Advent of Code 2023 in Rust

My Advent of Code 2023 solutions in the Rust programming language. This repository holds a separate Rust project for each day and part.

I attempt to develop a standalone, elegant, compact and fast solution for each problem (two each day).

Two years ago I did the same, solving everything in under a second:

Timings

Here is how long each solution runs with my input. All solutions are measured (non scientifically) in bench.rs on an AMD Ryzen 9 5900X (24) @ 3.7GHz machine running Linux.

	part A	part B
day 1	`0.016 ms`	`0.028 ms`
day 2	`0.011 ms`	`0.016 ms`
day 3	`0.019 ms`	`0.018 ms`
day 4	`0.017 ms`	`0.017 ms`
day 5	`0.015 ms`	`0.034 ms`
day 6	`0.001 ms`	`0.001 ms`
day 7	`0.065 ms`	`0.066 ms`
day 8	`0.028 ms`	`0.122 ms`
day 9	`0.042 ms`	`0.042 ms`
day 10	`0.048 ms`	`0.095 ms`
day 11	`0.012 ms`	`0.008 ms`

	one-by-one (1 CPU core)	parallel
everything	`0.77 ms`	`0.32 ms`

Run solutions

Each Rust project needs a input.txt file to run, holding the puzzle input. Simply create this file with your input and run the project to see the solution appear.

# Switch to day 1a, add input, and run it
cd day01a
nano input.txt
cargo +nightly run --release

# or run everything in parallel
cd ../runner
cargo +nightly run --release --bin runner-par

# or benchmark every day
cd ../runner
cargo +nightly run --release --bin bench

Some solutions require Rust Nightly, that's why +nightly is included.

Sadly I cannot include my puzzle input anymore to make each solution easily runnable as per Advent of Code FAQ:

If you're posting a code repository somewhere, please don't include parts of Advent of Code like the puzzle text or your inputs.

Other years

2023 (current)
2022
2021
2020
2019
2018
2017

License

This project is released under the GNU GPL-3.0 license. Check out the LICENSE file for more information.

Comments

day 4 - did you use map for performance?

Hi!

mapping is not necessary:

-                    .map(|n| &n[1..])
-                    .filter(|n| win_seq.chunks_exact(3).map(|n| &n[1..]).any(|c| &c == n))
+                    .filter(|n| win_seq.chunks_exact(3).any(|c| &c == n))

Did you do that for performance?

Maybe you could enable "Discussion" for this project :smile:

opened by tivrfoa 1

day 5 b - wrong answer for my puzzle input.

my input I get an output of 100644325, but the expected correct answer should be 37806486.

Originally posted by @TonyMarsh31 in https://github.com/timvisee/advent-of-code-2023/discussions/4

opened by TonyMarsh31 0