https://github.com/teo-tsirpanis/hashcode-2019
The Google Hash Code qualifying round submission of the Daemon Demons team.
https://github.com/teo-tsirpanis/hashcode-2019
fsharp hashcode hashcode-2019
Last synced: 8 months ago
JSON representation
The Google Hash Code qualifying round submission of the Daemon Demons team.
- Host: GitHub
- URL: https://github.com/teo-tsirpanis/hashcode-2019
- Owner: teo-tsirpanis
- Created: 2019-02-28T17:02:12.000Z (almost 7 years ago)
- Default Branch: master
- Last Pushed: 2019-03-05T20:36:54.000Z (almost 7 years ago)
- Last Synced: 2025-03-24T14:17:45.435Z (11 months ago)
- Topics: fsharp, hashcode, hashcode-2019
- Language: F#
- Homepage: https://codingcompetitions.withgoogle.com/hashcode/certificate/round/0000000000050094
- Size: 8.29 MB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Daemon Demons - Google Hash Code 2019
This repository contains the source code of the Google Hash Code qualifying round submission of the Daemon Demons team.
## About the team
The team was formed by three Greek Computer Science university freshmen from Thessaloniki:
* Georgios Basioukas (@GeorgiosBas) - Department of Applied Informatics, University of Macedonia
* John Tsenekidis (@PhantomXL) - Department of Computer Science, Aristotle University of Thessaloniki
* Theodore Tsirpanis (@teo-tsirpanis) - Department of Applied Informatics, University of Macedonia
We participated at the University of Macedonia hub.
## Technologies used
We wrote the solution in [F#](https://fsharp.org), a functional-first programming language [designed to encourage clean and correct code](http://fpbridge.co.uk).
Its rapid prototyping capabilities were exemplified by the fact that our first, 300k point graded submission was the first among the hub.
## Score
The team's final score was __478,481 points__. Specifically, we placed:
* __1st__ (out of 10) in our hub.
* __21st__ (out of 92) in Greece.
* __1607th__ (out of 6671) in the world.
