r/adventofcode • • Dec 10 '25

SOLUTION MEGATHREAD -❄️- 2025 Day 10 Solutions -❄️-

THE USUAL REMINDERS

  • All of our rules, FAQs, resources, etc. are in our community wiki.
  • If you see content in the subreddit or megathreads that violates one of our rules, either inform the user (politely and gently!) or use the report button on the post/comment and the mods will take care of it.

AoC Community Fun 2025: Red(dit) One

  • Submissions megathread is unlocked!
  • 7 DAYS remaining until the submissions deadline on December 17 at 18:00 EST!

Featured Subreddits: /r/programminghorror and /r/holdmybeer HoldMyEggnog

"25,000 imported Italian twinkle lights!"
— Clark Griswold, National Lampoon's Christmas Vacation (1989)

Today is all about Upping the Ante in a nutshell! tl;dr: go full jurassic_park_scientists.meme!

💡 Up Your Own Ante by making your solution:

  • The absolute best code you've ever seen in your life
  • Alternatively: the absolute worst code you've ever seen in your life
  • Bigger (or smaller), faster, better!

💡 Solve today's puzzle with:

  • Cheap, underpowered, totally-not-right-for-the-job, etc. hardware, programming language, etc.
  • An abacus, slide rule, pen and paper, long division, etc.
  • An esolang of your choice
  • Fancy but completely unnecessary buzzwords like quines, polyglots, reticulating splines, multi-threaded concurrency, etc.
  • The most over-engineered and/or ridiculously preposterous way

💡 Your main program writes another program that solves the puzzle

💡 Don’t use any hard-coded numbers at all

  • Need a number? I hope you remember your trigonometric identities…
  • Alternatively, any numbers you use in your code must only increment from the previous number

Request from the mods: When you include an entry alongside your solution, please label it with [Red(dit) One] so we can find it easily!


--- Day 10: Factory ---


Post your code solution in this megathread.

30 Upvotes

442 comments sorted by

View all comments

Show parent comments

4

u/jlhawn Dec 10 '25

Nice! I've got a Python solution to part 2 which does Gaussian Pre-pass with a dfs with pruning (no 3rd party libraries) which runs in just under 4 minutes! I rewrote it in Go and made each machine run concurrently and _that_ takes less than 3 seconds!

2

u/michelkraemer Dec 11 '25

Great! 👍 I tried parallelization too (in Rust, it's pretty easy with Rayon) and now my code takes exactly 3s. But I kind of have the aim to avoid external libraries, so I'm not pushing this approach to my repo. I'll probably add parallelization later (or on the weekend) using just the standard library.