hac VS aoc2020

HAC's "Semantics" target now sets up identifier lists, a feature that happens to match the need for a smart editor's auto-complete feature. In particular, the LEA team seems to be happy about that new development.

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

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

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

Good that you got it working! My version in C is a bit shorter, perhaps you could use some ideas for the next puzzles? I like the dynamically sized getline() function, for instance: https://github.com/ednl/aoc2020/blob/main/day06.c

Here is my C version with lots of built-in checks: https://github.com/ednl/aoc2020/blob/main/day03.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

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