Someone improved my code by 40,832,277,770%
Stand-up Maths1 HN recommenders · 2022–2023
3.1M views · explainer · evergreen · Uploaded 2022-10-17
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.
Cited as a fun example of how algorithmic changes can yield enormous performance gains.
9:52Vectors | Chapter 1, Essence of linear algebra
3Blue1Brown
49:55How Python was Shaped by leaky Internals, Armin Ronacher, Flask framework
Видео с мероприятий {speach!
19:42But what is the Fourier Transform? A visual introduction.
3Blue1Brown
18:40But what is a neural network? | Deep learning chapter 1
3Blue1Brown
24:26The Beauty of Bézier Curves
Freya Holmér
1:13:50The Continuity of Splines
Freya Holmér
1:12:27CppCon 2015: Andrei Alexandrescu “std::allocator...”
CppCon
1:00:43Jim Simons (full length interview) - Numberphile
Numberphile2
4 comments from Hacker News
See also “Someone improved my code by 40,832,277,770%” < [VIDEO] > by Matt Parker. It can be a really fun game!
> 'Drastically' in this context can mean the slower approach taking billions of times longer. Standupmaths - "Someone improved my code by 40,832,277,770%": [VIDEO] (OK, 41 billion percent is only 0.41 billion times better, but still.)
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]
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.