hac VS aoc2020

HAC: release 0.2 with an interface between a program being run by HAC and the program running HAC as an embedded compiler. If you feel confused by reading that, it is normal ;-). Perhaps the following blog post will help clarifying things... https://gautiersblog.blogspot.com/2022/06/hac-as-embedded-compiler.html List of HAC releases here: https://github.com/zertovitch/hac/commits/master

Web site: http://hacadacompiler.sf.net/ From there, links to sources, and an executable for Windows.

HAC: release 0.1 with support for packages; improvement of the VM with instructions that do the job of two or more instructions. List of changes here: https://github.com/zertovitch/hac/commits/master

Source repositories: #1 svn: https://sf.net/p/hacadacompiler/code/HEAD/tree/trunk/ #2 git: https://github.com/zertovitch/hac

Home page here, svn repo here, git repo here.

I got all but one star in 2020 when I did it in Python: https://github.com/ednl/aoc2020 but I'm afraid there may be some short variable names despite not doing it for speed.

I liked my solution for https://adventofcode.com/2020/day/17 Game of Life in 3D and 4D: https://github.com/ednl/aoc2020/blob/main/day17.py

Day 8 runs in 0.02 s using python 3.9 on my M1 Mac Mini. Just flipping in part 2, no special optimisation. My code: https://github.com/ednl/aoc2020/blob/main/day08.py

For instance, I wrote this in C for day 15 https://github.com/ednl/aoc2020/blob/main/day15.c which runs in 1.635 s on a Raspberry Pi 4 (4 GB, RPiOS 32-bit on SSD, overclocked to 1.8 GHz) when timing on the command line with "time", taking the lowest "user" value of about 10 manual runs. Compiled with gcc -Ofast (version 8.3.0).

Yep, linked above, or: https://github.com/ednl/aoc2020/blob/main/day15.c

Day 23 part 2 in 0.06 s on a dual core 1.3 GHz i5 Haswell (2013 MB Air) https://github.com/ednl/aoc2020/blob/main/day23.c because of a simple array as a linked list.

Day 23 part 2 (1 million cups, 10 million moves) runs in 0.06 s on my 2013 dual core Haswell i5 1.3 GHz. Main reason is a super fast simulated linked list via a pre-allocated array of integers. Source https://github.com/ednl/aoc2020/blob/main/day23.c

Python, Numpy, SciPy Took me a while to figure out how to calculate the new state with different kernels for odd and even rows. In the end, it means doing almost twice the work. Still about 9x faster than the native Python version I did first. Part 2 below, full code at https://github.com/ednl/aoc2020/blob/main/day24alt.py

Thanks to /u/thomasahle for encouraging me to implement axial coordinates, which made it a lot easier. Also thought of a better way to parse the input in one go. And this allowed me to tighten up the grid dimensions. Runs in under a second on a very old laptop, half of which is because of the scipy import ... https://github.com/ednl/aoc2020/blob/main/day24alt2.py

Yes, definitely don't create a list for every pick up. No need to insert and delete if you use an array as a linked list. My code: https://github.com/ednl/aoc2020/blob/main/day23.py