Someone improved my code by 40,832,277,770%

Stand-up Maths · 3.1M views · 2022-10-17 · 28:47

Open on YouTube ↗

If playback is restricted in your region, try opening the original video. Use Mark watched to add it to your marked videos.

Overview

Matt Parker follows the community effort to speed up his slow Wordle-solving code, which ended up running hundreds of millions of times faster. He walks through the techniques contributors used.

On Hacker News

Cited as a fun example of how algorithmic changes can yield enormous performance gains.

Recommended by 1 HN people across 1 months · HN mentions 2022–2023

Topics

Software performance & optimization Algorithms & data structures Recreational & visual math

What people said

db48x · 2022-12 · Recommendation
See also “Someone improved my code by 40,832,277,770%” < [VIDEO] > by Matt Parker. It can be a really fun game!
Read the original HN comment ↗

high_priest · 2023-08 · Reference
Quick google yields very good examples in huge improvements on a single algorithm level: [VIDEO] Easy to imagine how even smaller improvements across 10-100 steps of data processing, can become even better.
Read the original HN comment ↗

otikik · 2023-01 · Joke / meme
Also keep in mind that there’s people out there that will take your code and make it 40.363.757.265% more efficient (perhaps not in this case) [VIDEO]
Read the original HN comment ↗

Sources

Video by Stand-up Maths, played through YouTube.

HN Library · Source license

Data and selection notes

HN summaries and labels may contain AI errors. HN dates refer to discussions, not video publication.

HN Library: HackerTube export (2026-10-31) and open-index/hacker-news. Upstream summaries and classifications may contain AI errors.

Views, duration and playback status refresh separately from the published catalog. When an update fails, existing data remains visible.

Selection checks

SaaS & AI candidates: Topic keywords do not match
Editor-approved picks: Editorial review is required

Rule matches identify candidates. They do not guarantee video quality or financial results.

About the library and its sources