aoc-2021-cpp VS advent_of_code_2021

The solution is manual and well described here. I wrote an AOI simulator and some analysis code in this Go program analyzing the structure of the input and showing some sample simulations. The most interesting output is right at the beginning if you run it where it shows the (very few) differences that each digit's treatment shows - there is no way I would have found the manual solution without the info from that program.

I think my part 2 is one of the simplest solution I have seen so far and still runs decently fast (200 ms on my MB Pro) - even though there are many much faster on here.

My solution (Go) for part 2 does not use any cache (or Dynamic Programming - I am not trained in CS) and runs in 10 ms on a MacBook Pro and I doubt a cache would speed that up significantly.

Part1 was so simple that it's not worth talking much about it. My solution to Part2 is:

This solution solves the puzzle and is being well structured and readable. However, I gave up on my goal to make it fast - I had spend enough time on this that I just wanted to spend time on different things than code (heresy - I know). My only solution slower than a second this year so far (it's uh 35 sec on my MB pro)!

I am pretty satisfied with my solution to this problem even though there is some optimization potential left on the table - it solves the puzzle in 500 ms on my MB pro.

Here is my final (faster) solution and the one with maps (I avoided mentioning the concrete algorithms in the post in order to avoid spoilers but it's in the comments there)

My code is NOT optimized for brevity but for a balance of execution speed and readability. As this is not a brute force solution, speed does not really matter - otherwise the manual statements mentioned in the beginning are most likely faster than my fingerprint comparison. It runs on my MacBook in 1.5 ms if I suppress the repeated text output that is in the Github version (3 ms with all the text output).