toit VS advent-of-code

It uses toit, a high-level language, and is thus quite easy to learn. At the same time it's an order of magnitude faster than micropython.

We have been faced with the same question and decided to open-source pretty much all of our product (https://github.com/toitlang/toit).

I also really like MicroPython! Having said that, I have been working on an alternative to it for a number of years now -- primarily to provide a more robust and performant high-level alternative to C and Rust on the ESP32-family of chips:

https://github.com/toitlang/toit

I'd love to pick your brain and fully understand your experience with MicroPython. I've been doing programming languages for a number of years now, and I find that it is incredibly useful to understand what developers appreciate (and dislike) about the available stacks.

Thank you for the mention!

I have been working on the Toit language for the ESP32 for a number of years now -- and it has been an enjoyable challenge to build an open source stack capable of supporting live reloading on a micro-controller that can run for years on batteries.

https://github.com/toitlang/toit

We use it for some of our tools, so it's possible (and works nicely). Our LSP server was initially written in Toit: https://github.com/toitlang/toit/tree/master/tools/lsp/serve...

[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):