GoogleCodeJam: A monad for flexible parsing of Google Code Jam input files with automatic parallelization.
For more (including usage examples and solutions to GCJ problems) see Readme on Github.
[Skip to Readme]
Downloads
- GoogleCodeJam-0.0.3.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.0.1, 0.0.2, 0.0.3 |
|---|---|
| Dependencies | array (>=0.5.0.0 && <0.6), base (>=4.9.0.0 && <4.10), containers (>=0.5.5.1 && <0.6), mtl (>=2.2.1 && <2.3), parallel (>=3.2.1.0 && <3.3), safe (>=0.3.10 && <0.4), split (>=0.2.3.1 && <0.3), transformers (>=0.5.2.0 && <0.6) [details] |
| License | MIT |
| Author | Johannes Gerer |
| Maintainer | Johannes Gerer <oss@johannesgerer.com> |
| Category | Text |
| Home page | http://johannesgerer.com/GoogleCodeJam |
| Bug tracker | http://github.com/johannesgerer/GoogleCodeJam/issues |
| Uploaded | by johannesgerer at 2017-01-22T19:12:15Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 2520 total (1 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |
Readme for GoogleCodeJam-0.0.3
[back to package description]googleCodeJam 
A monad for flexible parsing of Google Code Jam input files with automatic parallelization.
Read the documentation on Hackage.
Examples
For usage examples check out my submission contained in this repository.
2014 Round 1A Problem B
This short and simple solution achieves linear speedup on 4 cores.