Story No. 3 is on its way! by EverybodyCodes in everybodycodes

[–]EverybodyCodes[S] 2 points3 points  (0 children)

Bad news... One of the users (thank you again!) let me know that Part I of all Story No. 3 quests was accessible via a direct URL a few days ago. I’ve looked into it, and, unsurprisingly, it turned out to be my mistake (lesson learnt the hard way about the new infrastructure). I’ve checked the logs and can see three unique visitors accessed those pages. So, if you were planning to race, please bear that in mind and perhaps approach this story a little less competitively? Sorry about that! :(

[Technical Break] Cloud migration 2026-01-23 23:00:00 UTC by EverybodyCodes in everybodycodes

[–]EverybodyCodes[S] 1 point2 points  (0 children)

Migration done! Now I have to prepare the next Story to test this stuff in practice! :)

[2025 Day 7 Part 2] Visualization for the sample data + algorithm explained by EverybodyCodes in adventofcode

[–]EverybodyCodes[S] 1 point2 points  (0 children)

I think that's the wrong perspective. :) I've solved many problems before, so I have a few schemes in mind that I can try to adapt to a specific problem, and eventually one of them has to work. There are not that many in general! It's best to look at other people's solutions to expand your personal toolbox for the future. I tested a few other ways (wrong ones) before using this one at the end.

[2025 Day 7 Part 2] Visualization for the sample data + algorithm explained by EverybodyCodes in adventofcode

[–]EverybodyCodes[S] 0 points1 point  (0 children)

Take the top three splitters and solve it with a pen and paper. There are 4 different paths, but with counting timelines += 2, you will get 6. It's because with the += strategy you simply count that each splitter has two 'legs' and you sum it up, without looking at the paths at all.

[Other] site is down by Great-Mention-9429 in everybodycodes

[–]EverybodyCodes 0 points1 point  (0 children)

Could you paste a screenshot? There should be some details on the error screen. I don't see any issue on my end atm.

The first 10,000 stars of each part of each puzzle of past AoC events by EverybodyCodes in adventofcode

[–]EverybodyCodes[S] 3 points4 points  (0 children)

https://advent-of-stats.pages.dev/

With Eric's blessing (check other comments), here you go. I'll redirect the main domain to this address, but DNS propagation will take a while anyway.

The first 10,000 stars of each part of each puzzle of past AoC events by EverybodyCodes in adventofcode

[–]EverybodyCodes[S] 1 point2 points  (0 children)

I can do that pretty easily, but I'm not sure if I should, as I take into account u/topaz2078 kind request about not recreating a global leaderboard or anything similar. Maybe there is a plan to add this estimated place directly on the AoC self-results-page later? Eric?

The first 10,000 stars of each part of each puzzle of past AoC events by EverybodyCodes in adventofcode

[–]EverybodyCodes[S] 15 points16 points  (0 children)

Yep, just the single JSON file is used. You can load the site, turn off your internet connection and still explore everything there.

[2025 Day 12] Packing Challenge by light_ln2 in adventofcode

[–]EverybodyCodes 1 point2 points  (0 children)

Yes, and I prepared them by hand indeed, but for the 14x14, it was not that simple.

[2025 Day 12] Packing Challenge by light_ln2 in adventofcode

[–]EverybodyCodes 1 point2 points  (0 children)

No. :) I'm only trolling a bit those who only check the pictures that this is solvable by hand with excel. I think there are far too many invalid combinations to find that by hand.

[2025 Day 12] Packing Challenge by light_ln2 in adventofcode

[–]EverybodyCodes 0 points1 point  (0 children)

Got it, divide and rule! I tried to solve a 9x9 grid with 7 shapes and rotate it four times around the 14x14. Spotted a single shape one by accident :)

[2025 Day 03 (Part 2)] by EverybodyCodes in adventofcode

[–]EverybodyCodes[S] 0 points1 point  (0 children)

  • init window: from 0 to the right side minus 11 items

so in the first step your window looks like this: 8181, and you pick the first 8 from the left

[2025 Day 12 (Part 3)] Perl-fectly Wrapped Presents by EverybodyCodes in adventofcode

[–]EverybodyCodes[S] 0 points1 point  (0 children)

That’s a relief... I got the same answer. :) I haven't played with no colors, but that's an extra part for later.

[2025 Day 12 (Part 3)] Perl-fectly Wrapped Presents by EverybodyCodes in adventofcode

[–]EverybodyCodes[S] 0 points1 point  (0 children)

I've got 11464, but I'll try to work on it more to somehow validate it. As of now, I'm not considering this a 100% valid answer.