# I got sucked into a coding challenge that turned into a > Source: > Published: 2026-08-31 16:00:53+00:00 # I got sucked into a coding challenge that turned into a It started when someone reached out via my GitHub repo. They didn't mention my flexbox skills; instead, they claimed Peter Norvig (the AI legend, not just some random guy) was being held hostage by a piece of code that was hogging all the CPU and memory. Apparently, even ThePrimeagen’s Rust solution couldn't crack it. The weirdest part? I apparently became Ryan Gosling halfway through. The person running this challenge apparently went into my GitHub bio, added a space, capitalized a few letters, and boom—I was no longer a dev, I was a movie protagonist. ## The rabbit hole of clues and chaos This wasn't a standard LeetCode-style prompt. This was an absolute deep dive into a massive, unpredictable AI workflow of memes and mystery. The guy running the show (shoutout to algorhymer on dev.to) had apparently been running these for two years, and despite about 100 developers getting involved, nobody had actually finished it. The "hints" were a complete mess of: - Cryptic references to *Tenet*and*Sicario* - Randomly placed road signs and bird videos - Extremely specific observations about Ygritte’s eyebrow movements - An endless supply of April Ludgate GIFs At one point, he tried to give me some "ancient Georgian expression" about a "rebar girl" who fights high-tech magic with a piece of iron. Spoilers: the expression doesn't actually exist. He just made it up on the spot to keep the vibe going. I just grabbed my imaginary steel pipe and kept moving. ## The actual technical bottleneck Once you strip away the cinematic madness and the weirdly accurate Georgian, there was a real algorithmic problem sitting at the center of the mess. It was based on the **Advent of Code 2022, Day 5 - Supply Stacks** puzzle. If you haven't done AoC, the logic is straightforward: you have numbered piles of crates and a list of instructions like `move 4 from 2 to 1` . You follow the sequence and then identify the top crate of each stack. But here's where it gets intense for anyone looking for a real-world performance test: **The Input Scale:** While a standard AoC input is tiny, this version was bloated to roughly**86,000 lines**.** The Complexity:**You can't just brute force this with a naive script if you're trying to beat a "wall-clock time" opponent.** The Goal:**Efficiency matters. You're essentially managing stack operations at scale, and the way you parse and execute those moves determines whether you actually solve the "hostage" situation or just hang your local machine. I spent more time trying to figure out if a GIF was a hint or a joke than I did actually writing the logic, but honestly, that's the best kind of dev rabbit hole. If you ever find yourself in a challenge where the instructions look like a fever dream, just keep coding. [Next Your baseline is lying to you and it will liquidate your →](/en/threads/8285/)