aoc VS adventofcode.sh

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

I have completed years 2015 and 2020 in bash. Gave up halfway through last year, might do that one day. https://github.com/einarjon/adventofcode.sh

Python3 is about 25% faster than Python2, with the exact same code. Pypy3 was somewhere in between. https://github.com/einarjon/adventofcode.sh/blob/main/2015/04.sh

Mine is on github too. I think that my worst abuse of grep is this: https://github.com/einarjon/adventofcode.sh/blob/main/19.sh Before the cleanup my part2 regex was around 6-7K chars.

My final script is in my repo, but an earlier commit has this brute force version. https://github.com/einarjon/adventofcode.sh in the 2021 folder.

Day 1 was 10 LOC, each day is adding about 10 LOC, so now I'm at 40. I don't like where this is heading. https://github.com/einarjon/adventofcode.sh/blob/main/2021/04.sh Small mistake in Part 2 so it starts the bingo from the beginning, but the first numbers are crossed out. Doesn't affect the result.

My solution this year was almost exactly like the one __abigail__ posted. I based it on last year's code for day 12. There are 50 days worth of bash solutions in that repo if you're interested. Some contain Voodoo, but it's mostly readable - I hope...

I linked to the code. Here it is again. Might be slower in git bash, but works. https://github.com/einarjon/adventofcode.sh/blob/main/13.sh