aoc VS pony_aoc2021

My Python solution from many years ago: https://github.com/mkst/aoc/blob/master/2015/05.py. Also have a Go version alongside if that helps?

This is my solution: https://github.com/mkst/aoc/blob/master/2015/06.py. i haven't looked at it for quite a long time, but one difference is I'm doing the heavy lifting in terms of parsing the input upfront, so my loops have fewer if statements. Not at my PC to see how long this takes though.

This is my golang solution if it helps? I solved 2015 in a few different languages, and this was my first foray into golang... https://github.com/mkst/aoc/blob/master/2015/15.go

Count each pair... like the lantern fish. Fairly instant in an interpreted language. https://github.com/mkst/aoc/blob/master/2021/14.q. The only gotcha was that there were duplicate pairs in the initial input.

For each board I created a bitmask to track called numbers. Iterate through the bingo calls. If the call results in a line, I return the "answer" otherwise return the updated bitmask. After iterating over all boards I have a list of results, then for part 1, pick the first result that was a number rather than bitmask, and part 2 find the last result... It's pretty horrible when explained in words, but the code is.. ok-ish. https://github.com/mkst/aoc/blob/master/2021/04.q

My solution is written in Pony which is an Actor based language so I obviously wanted to solve all the boards in parallel.