adventofcode VS advent-of-code

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.

[LANGUAGE: Python]

Python, Part 1 Only

Python

Rust Version

Rust

When I get back home after the holiday weekend I'll try benchmarking on my machine properly. But here's my version (in Common Lisp): https://github.com/rabuf/advent-of-code/blob/master/2018/2018.09.org

Rest of 2021

I'm partial to Common Lisp, but both Scheme and Racket would be good choices as well. There's a few of us who've been using CL the last few years to solve (nearly) every puzzle. If you want to see (not always great) solutions to the puzzles in Common Lisp, here's my repo, of course don't look at days you haven't solved yet unless you want spoilers. But it can give you a feel for how CL can be used to solve the problems. I'd intended to revisit them and clean them up, but never got around to it.

Interestingly, I think that solution is rather near the memoized version in one key regard. It's not memoization, however it's still storing all the results (the count for every joltage adaptor). You can massively reduce its storage by going with something like my solution (C-f for "part 2", there are two solutions one in Common Lisp and one in Ada), which is like the non-memoized iterative fibonacci series (psuedocode, pythonesque):