Advent-of-code VS AdventOfCode2021

Wow, almost identical to mine: https://github.com/MichalMarsalek/Advent-of-code/blob/master/2022/Nim/day6.nim

This year I was writing two sets of solutions in Nim. The first one focuses on idiomatic, nice and short and readable Nim. The other focuses purely on speed. The combined running times of the fast solutions is 130 ms. Please let me know if you have any tips on how to make my solutions more simple and/or idiomatic.

Beautiful Nim! My solution is actually very similar.

Full program on GitHub.

Full program including code to deal with heaps, on GitHub.

Program I used for the above results

See my solution on GitHub.

Note also that you can solve this without a complexity dependency on n. Most solutions I have seen, including mine run in time O(tD), where t is the maximum value of a timer, and D the number of generation, requiring O(t) memory. (This is assuming we can do the required arithmetic operations in constant time, and each numbers require a fixed around of memory storage; if the number of fish gets huge, throw in an additional log n in the complexities, where n is the number of fish on the final day).

Based on my matrix exponentiation solution, here is a closed-form solution:

In my Perl solution of today (I assume, you mean 2021, Day 4), I read stuff in paragraph mode ($/ = "") which makes Perl split input on 2 or more newlines.

I considered doing that for my (Perl) solution, but given the cards are small, that seemed overkill.

Python implementation on GitHub