aoc2022 VS aoc2022

It may be a nifty hash table (no, it is!:)) but the whole program runs about 12x slower on an M1 than my version where I first determine the max dimensions and simply allocate a grid of booleans... So I wonder how much the 8x8 bitset breakup could improve. But bitsets are a C++ feature. In C, like NRK: https://github.com/ednl/aoc2022/blob/main/09.c (my "startstoptimer.c" and .h are in the same repo)

I also checked lines but only after doing a rotation by 45 degrees, so the lines are straight. Compiled in C, fastest run time on M1 was 26 µs: https://github.com/ednl/aoc2022/blob/main/15.c

Same code but with preprocessed input to make it all fit into memory, runs in 7 ms on an Arduino Uno! https://github.com/ednl/aoc2022/blob/main/aoc22-15/aoc22-15.ino

Complete program runs in 463 µs on Apple M1, 2.61 ms on Pi 4. See comments at the top of the source file for how I measured. My comparison function:

Not 100% sure this is Upping-The-Ante, maybe just Other. I wanted to share some benchmark results of my solution for today, day 11 with the 10,000 monkeys, and how I got there. I think the easiest way to compare performance is to use the same hardware, and nowadays fairly common & standardised hardware might be the Raspberry Pi 4. Although, you can't buy any for years now... Best score I got when running my solution on my Pi 4 home server is 15.6 ms.

I quickly saw that I could do "item = item modulo (product of all div-test numbers)" but the implementation took me a while in C without queues or circular buffers. But that's all part of the fun for me! I didn't look for further clever optimisations because the compiled program runs in 20 ms on a Raspberry Pi 4. That was fast enough for today, I thought. Source code: https://github.com/ednl/aoc2022/blob/main/11.c

Yay, embedded software engineering!! :) Short, fast & almost no memory needed in C: https://github.com/ednl/aoc2022/blob/main/10.c or the relevant bits:

That's great, but on what hardware? My solution in C runs in 0.8 ms average (0.6 ms minimum) using hyperfine to measure 1000 runs in a Mac Mini M1. Same on a Pi 4 in performance mode: 3.6 - 3.8 ms.

Well, it took me a while to realise that in part 1 you always have to check the whole row or column because a higher tree can come at any point ... And except for skipping the borders, I couldn't come up with any sort of clever optimisation that would help reduce the O(N^2) complexity. It still runs in under 1 ms on a Mac Mini M1 according to hyperfine. Full code 52 lines without space/comments: https://github.com/ednl/aoc2022/blob/main/08.c

no_std Rust targeting 8-bit 6502: https://github.com/mrk-its/aoc2022/blob/main/day15/src/main.rs It takes 26 hours to complete both parts :]

After optimizations both parths complete in 1902285369 cpu cycles, it is about 0.5h on atari800. github: https://github.com/mrk-its/aoc2022/tree/main/day14/src Can you show source code? How long your solution takes?

Rust targetting 8-bit Atari, with visualization.

It is emulator (unfortunately no real hardware near me). But let's up the ante: maybe someone with real atari can build these solutions and post photos on real hardware? :] Hint: repository contains VSCode devcontainer configuration, simply type 'make' in container terminal :] https://github.com/mrk-its/aoc2022

no_std Rust targetting 8-bit MOS6502: https://github.com/mrk-its/aoc2022/blob/main/day07/src/main.rs Computed in 11275620 cpu cycles

Rust-compiled version (rust-mos / llvm-mos) completes in 5mln of cycles, so about 5seconds: https://github.com/mrk-its/aoc2022/blob/main/day03/src/main.rs