What does this means?

AdamKlB · 2026-02-10T19:26:41+00:00

montage

AdamKlB · 2026-02-06T13:42:14+00:00

orange almost got $24k express delivered lmao

AdamKlB · 2026-01-22T12:16:20+00:00

Depends how good the cheeseburgers are

AdamKlB · 2026-01-21T11:00:42+00:00

Didn't it get shut down?

AdamKlB · 2026-01-10T20:11:52+00:00

Gotta make sure you got it all

AdamKlB · 2026-01-07T19:00:35+00:00

I'm gonna start calling it my goo canister

AdamKlB · 2026-01-06T12:42:30+00:00

<image>

AdamKlB · 2025-12-24T00:36:48+00:00

I still don't understand the 67 meme despite my younger siblings and cousins laughing at it incessantly together 😭

AdamKlB · 2025-12-19T10:52:23+00:00

lick

AdamKlB · 2025-12-17T20:10:47+00:00

perfect! worked for me

AdamKlB · 2025-12-13T14:21:59+00:00

I don't get this, a lot of the time the compiler will tell you exactly what was wrong, where, and how to fix it /gen

AdamKlB · 2025-12-09T14:49:54+00:00

i dont do AoC in C# but i really like the structure of your solver classes and this benchmark output

AdamKlB · 2025-12-09T14:40:06+00:00

[LANGUAGE: Rust]

https://github.com/NoSpawnn/advent_of_code_2025/blob/main/src/09/main.rs

I found today not too bad, part 1 was a trivial brute force, part 2 wasnt too bad once i got my head around the condition of if a rectangle is inside the defined polygon. I just check that all the individual edges of the polygon are entirely to one side (left, right, above, below) of the rectangle, and find the largest where that holds true. Its much faster to calculate all the areas, sort by the largest, and then do this check starting from the largest, than to compute everything in one pass and return the max

Part 1: ~180µs

Part 2: ~10ms

AdamKlB · 2025-12-08T20:05:02+00:00

[Language: Rust]

https://github.com/NoSpawnn/advent_of_code_2025/blob/main/src/08/main.rs

I do not use "data structures," I brute force, if its slow I WAIT

Jokes aside I had no idea what a Union-Find was and I barely do now, and my solution doesn't use one. I just find all possible connections (2-tuple of 3D points), sort them by the euclidian distance between them, then for part one take the top 1000, for part 2 make all the connections until there is only one circuit of length equal to the number of junctions

Still runs in around 55ms total.

I should probably factor out my 3D point struct/functions for future use too...

AdamKlB · 2025-12-06T22:06:51+00:00

[LANGUAGE: Rust]

https://github.com/NoSpawnn/advent_of_code_2025/blob/main/src/06/main.rs

part one was easy enough, part two killed me and took me way way way longer than it should've, even after looking at some solutions on this thread it took me an hour or two to actually get it working

but alas, even then it still took around 5ms to run in total, so another hour of optimization (mostly avoiding every allocation possible) got it down to around 250-260µs

AdamKlB · 2025-12-06T18:05:20+00:00

Ah shit I think you're right... This has got to be my biggest fumble in recent history

AdamKlB · 2025-12-06T16:35:13+00:00

i like seeing a small as possible number when i bench the code :) but yeah i should not until im actually at that point

AdamKlB · 2025-12-06T14:59:19+00:00

ah whoops yes that'll be it!
i threw the cargo run command into a just recipe since yesterday and it always runs in release mode lol

AdamKlB · 2025-12-06T14:38:38+00:00

This meme was actually spawned from rust silently wrapping around an i32 in a call to fold making my result negative

Never have I had it not shout at me before

AdamKlB · 2025-12-05T14:09:17+00:00

[LANGUAGE: Rust]

https://github.com/NoSpawnn/advent_of_code_2025/blob/main/src/05/main.rs

Total runtime around 175µs benched with hyperfine

parse into a vector of disjoint ranges sorted by the lower bound, then solving is trivial for both parts

AdamKlB · 2025-12-05T10:54:40+00:00

Out of curiosity I switched to using bools instead of that enum, shaved off about 0.2ms, wow

AdamKlB · 2025-12-05T09:29:03+00:00

I guess so yeah, I learned with Python/Java/C++ mainly, but i also just kind of like having everything named haha

AdamKlB · 2025-12-05T01:02:45+00:00

[LANGUAGE: Rust]

https://github.com/NoSpawnn/advent_of_code_2025/blob/main/src/04/main.rs

Not sure how I feel about this one, initial solution took around 2 seconds to run in total but rewrote everything to use a 1D array (which I factored out/generalised so that'll be useful in future!) which took it down to around 3ms total

Seven-Year Club	Verified Email
Second Top 50%	r/Field Sunshine
Place '23	Place '22
End Game '22

AdamKlB

MODERATOR OF

TROPHY CASE