adventofcode VS adventofcode

This lets you cut out the relatively expensive fcount.remove(0) operation, and each loop is basically one addition and a few assignments. Full solution here.

Code

Your solution is pretty much exactly the super concise version of my definitely over-engineered solution.

You can see the code here

Here's my solution

Your solution looks remarkably similar to my Rust solution which solves both parts in 1.6s on the cheap NUC I use as my coding workstation.

It's in Rust, so I'm not sure how readable you'll find it, but in case it helps, you can see the code here.

I found a single crate with a bunch of binaries worked well. It let me use a shared library easily. You can see my crate organization here if that's helpful.

You can see my code here in case it helps.

Python readable easy-to-understand easy-to-implement parser (Recursive Descent) While one could argue this style of parser is overkill here, I always found it a strategy for an easy, "don't have to think too hard" parser and scales well for complex recursive grammars