Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/narimiran/adventofcode2020
My solutions for AoC 2020
https://github.com/narimiran/adventofcode2020
advent advent-of-code advent-of-code-2020 adventofcode adventofcode2020 nim nim-lang python racket
Last synced: about 2 months ago
JSON representation
My solutions for AoC 2020
- Host: GitHub
- URL: https://github.com/narimiran/adventofcode2020
- Owner: narimiran
- License: mit
- Created: 2020-11-29T18:28:26.000Z (about 4 years ago)
- Default Branch: master
- Last Pushed: 2023-11-30T07:10:17.000Z (about 1 year ago)
- Last Synced: 2024-10-14T15:04:19.501Z (2 months ago)
- Topics: advent, advent-of-code, advent-of-code-2020, adventofcode, adventofcode2020, nim, nim-lang, python, racket
- Language: Nim
- Homepage:
- Size: 126 KB
- Stars: 29
- Watchers: 4
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE.txt
Awesome Lists containing this project
README
# Advent of Code 2020
All my Advent of Code repos:
* [AoC 2015 in Nim, Python](https://github.com/narimiran/advent_of_code_2015)
* [AoC 2016 in Python, Clojure](https://github.com/narimiran/advent_of_code_2016)
* [AoC 2017 in Nim, OCaml, Python](https://github.com/narimiran/AdventOfCode2017)
* [AoC 2018 in Nim, Python, Racket](https://github.com/narimiran/AdventOfCode2018)
* [AoC 2019 in OCaml, Python](https://github.com/narimiran/AdventOfCode2019)
* [AoC 2020 in Nim, one liner-y Python, Racket](https://github.com/narimiran/AdventOfCode2020) (this repo)
* [AoC 2021 in Python, Racket](https://github.com/narimiran/AdventOfCode2021)
* [AoC 2022 in Python, Clojure](https://github.com/narimiran/AdventOfCode2022)
* [AoC 2023 in Clojure](https://github.com/narimiran/AdventOfCode2023)
## Solutions
Task | Nim | Python | Racket | Comments (for Nim solutions)
--- | --- | --- | --- | ---
[Day 1: Report Repair](https://adventofcode.com/2020/day/1) | [day01.nim](nim/day01.nim) | [day01.py](python/day01.py) | [day01.rkt](racket/day01.rkt) | Small check `elif s[i] + s[j] < 2020:` makes the whole program ~4x faster.
[Day 2: Password Philosophy](https://adventofcode.com/2020/day/2) | [day02.nim](nim/day02.nim) | [day02.py](python/day02.py) | [day02.rkt](racket/day02.rkt) | `scanf` useful as always.
[Day 3: Toboggan Trajectory](https://adventofcode.com/2020/day/3) | [day03.nim](nim/day03.nim) | [day03.py](python/day03.py) | [day03.rkt](racket/day03.rkt) | Keeping it below 20 lines :)
[Day 4: Passport Processing](https://adventofcode.com/2020/day/4) | [day04.nim](nim/day04.nim) | [day04.py](python/day04.py) | [day04.rkt](racket/day04.rkt) | Had a nasty early morning bug with `if not v.len == 9`. Argh.
[Day 5: Binary Boarding](https://adventofcode.com/2020/day/5) | [day05.nim](nim/day05.nim) | [day05.py](python/day05.py) | [day05.rkt](racket/day05.rkt) | Traversing a sorted list is more efficient than looking for every number in unsorted one.
[Day 6: Custom Customs](https://adventofcode.com/2020/day/6) | [day06.nim](nim/day06.nim) | [day06.py](python/day06.py) | [day06.rkt](racket/day06.rkt) | Classic AoC-use-sets tasks.
[Day 7: Handy Haversacks](https://adventofcode.com/2020/day/7) | [day07.nim](nim/day07.nim) | [day07.py](python/day07.py) | [day07.rkt](racket/day07.rkt) | Babushka bag = Bagushka.
[Day 8: Handheld Halting](https://adventofcode.com/2020/day/8) | [day08.nim](nim/day08.nim) | [day08.py](python/day08.py) | [day08.rkt](racket/day08.rkt) | Faster than it looks.
[Day 9: Encoding Error](https://adventofcode.com/2020/day/9) | [day09.nim](nim/day09.nim) | [day09.py](python/day09.py) | [day09.rkt](racket/day09.rkt) | Sliding slice sum.
[Day 10: Adapter Array](https://adventofcode.com/2020/day/10) | [day10.nim](nim/day10.nim) | [day10.py](python/day10.py) | [day10.rkt](racket/day10.rkt) | `CountTable` to the rescue.
[Day 11: Seating System](https://adventofcode.com/2020/day/11) | [day11.nim](nim/day11.nim) | | | The ugliest and the slowest solution so far.
[Day 12: Rain Risk](https://adventofcode.com/2020/day/12) | [day12.nim](nim/day12.nim) | [day12.py](python/day12.py) | [day12.rkt](racket/day12.rkt) | Using complex numbers is s[o][1][o][2][o][3][o][4] last Tuesday. No `Complex` this time.
[Day 13: Shuttle Search](https://adventofcode.com/2020/day/13) | [day13.nim](nim/day13.nim) | [day13.py](python/day13.py) | [day13.rkt](racket/day13.rkt) | Yeah yeah, [CRT](https://en.wikipedia.org/wiki/Chinese_remainder_theorem), but it took me way too long to implement it correctly.
[Day 14: Docking Data](https://adventofcode.com/2020/day/14) | [day14.nim](nim/day14.nim) | | | Good luck trying to understand what's going on.
[Day 15: Rambunctious Recitation](https://adventofcode.com/2020/day/15) | [day15.nim](nim/day15.nim) | | | Boring.
[Day 16: Ticket Translation](https://adventofcode.com/2020/day/16) | [day16.nim](nim/day16.nim) | | | Naming is hard.
[Day 17: Conway Cubes](https://adventofcode.com/2020/day/17) | [day17.nim](nim/day17.nim) | | | Nobody notices your 9 nested for-loops if you hide them in a template.
[Day 18: Operation Order](https://adventofcode.com/2020/day/18) | [day18.nim](nim/day18.nim) | | | Template and streams make this one really elegant.
[Day 19: Monster Messages](https://adventofcode.com/2020/day/19) | [day19.nim](nim/day19.nim) | | | My first experience with `npeg`.
[Day 20: Jurassic Jigsaw](https://adventofcode.com/2020/day/20) | | | |
[Day 21: Allergen Assessment](https://adventofcode.com/2020/day/21) | [day21.nim](nim/day21.nim) | | | Day 16, part 2 vibes.
[Day 22: Crab Combat](https://adventofcode.com/2020/day/22) | [day22.nim](nim/day22.nim) | | | Deque Deck for Crab Combat.
[Day 23: Crab Cups](https://adventofcode.com/2020/day/23) | [day23.nim](nim/day23.nim) | | | No Linked List for Crab Cups: 10x faster and lighter (less memory usage).
[Day 24: Lobby Layout](https://adventofcode.com/2020/day/24) | [day24.nim](nim/day24.nim) | | | Read [redblobgames](https://www.redblobgames.com/grids/hexagons/) if you haven't already.
[Day 25: Combo Breaker](https://adventofcode.com/2020/day/25) | [day25.nim](nim/day25.nim) | | |
[1]: https://github.com/narimiran/advent_of_code_2016/blob/master/python/day_01.py
[2]: https://github.com/narimiran/advent_of_code_2016/blob/master/python/day_02.py
[3]: https://github.com/narimiran/AdventOfCode2017/blob/master/nim/day19.nim
[4]: https://github.com/narimiran/AdventOfCode2017/blob/master/python/day22.py
## Run times
* Nim version 1.5.1 (devel)
* compiled with `-d:danger --gc:arc`
* CPU: AMD Ryzen 3700x @ 3.6 GHz (Linux 5.4)
The reported results are the average of 20 runs.
```
01 0.72 ms
02 0.82 ms
03 0.63 ms
04 1.23 ms
05 0.80 ms
06 0.96 ms
07 1.89 ms
08 1.06 ms
09 1.01 ms
10 0.72 ms
11 26.66 ms
12 0.93 ms
13 0.63 ms
14 11.57 ms
15 583.13 ms
16 4.62 ms
17 64.36 ms
18 1.48 ms
19 17.52 ms
20 12.16 ms
21 1.86 ms
22 1.06 ms
23 208.55 ms
24 16.32 ms
25 5.42 ms
--------------
966 ms
```