BenchmarkDotNet VS advent-of-code

The name of the library is BenchmarkDotNet and the documentation can be found here. The only thing you have to do is:

Benchmarking Tool: Uses BenchmarkDotNet for accurate and repeatable measurements.

Through Professional tools like Visual studio Performance tool BenchmarkDotNet DotTrace Profiler by Rider, Dynatrace Datadog

BenchmarkDotNet helps you measure performance with ease.

The benchmark test was conducted using the BenchmarkDotNet library in C#. The classes tested include:

Let’s look at the first example you see, when you open up BenchmarkDotnet’s website, or Github page.

Or use BenchmarkDotNet which, among other things to get an accurate benchmark, does JIT warmup outside of measurement.

( https://github.com/dotnet/BenchmarkDotNet ).

You can also do proper statistically correct benchmarking by using - https://github.com/dotnet/BenchmarkDotNet. This will run warmup the jit, gauge the overheads, and run your function many times to give you proper data.

take a look at: https://benchmarkdotnet.org/

I just did simple BFS on the lava cubes for part 1. For part 2, I just did a BFS on the bounding cube. Total runtime - 500 micro seconds for both parts on my 8 years old laptop: https://github.com/SvetlinZarev/advent-of-code/blob/main/2022/aoc-day-18/src/lib.rs

My solution is pretty simple - top down DP. On each step we can do only one of two things: * open a valve and stay in current position * do not open a vale, but move to a different positions

🦀🦀🦀 RUST 🦀🦀🦀

You can see it in action here: https://github.com/SvetlinZarev/advent-of-code/blob/main/2022/aoc-day-04/src/lib.rs

Rust

Here are the results of my benchmarks, which you can also run

You can calculate the distances between the points found by each scanner. If two scanners report points with the same distance between them, then most probably they are adjacent. Runs in 4ms on my machine: https://github.com/SvetlinZarev/advent-of-code/tree/main/2021/aoc-day-19

You can copy the release profile from here https://github.com/SvetlinZarev/advent-of-code/blob/main/2021/aoc-day-25/Cargo.toml#L8 and copy that directory to enable compilation for the machine's cpu https://github.com/SvetlinZarev/advent-of-code/tree/main/2021/aoc-day-25/.cargo

I want to share my repo for whoever is interested. It contains Rust solutions for:

Mine (rust)runs for 50ms for both parts. I've used just a regular bruteforce approach, so nothing fancy. There are several things I did that reduced the execution time: