Someone improved my code by 40,832,277,770%
Stand-up Maths1 HN recommender · recommended in 1 month, 2022-2023
3.1M views · 4 years ago · explainer · evergreen
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.
59:11How to Speed up a Python Program 114,000 times.
InfoQ
171K views • 13 years ago
19:25New computers don't speed up old code
Matthias random stuff
187K views • 1 year ago
2:50:14Simple Code, High Performance
Molly Rocket
463K views • 5 years ago
1:04:48"Performance (Really) Matters" with Emery Berger
Association for Computing Machinery (ACM)
7K views • 6 years ago
22:41"Clean" Code, Horrible Performance
Molly Rocket
1.2M views • 3 years ago
42:15"Performance Matters" by Emery Berger
Strange Loop Conference
502K views • 7 years ago
1:29:55Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019
CppCon
184K views • 7 years ago
!['Fastware' - Andrei Alexandrescu [ ACCU 2016 ]](https://i.ytimg.com/vi/AxnotgLql0k/hq2.jpg)
1:02:17'Fastware' - Andrei Alexandrescu [ ACCU 2016 ]
ACCU Conference
34K views • 10 years ago
1:30:03C++Now 2018: Matt Godbolt “What Else Has My Compiler Done For Me Lately?”
CppNow
11K views • 8 years ago
1:13:41CppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures"
CppCon
235K views • 12 years ago
18:41Refterm Lecture Part 1 - Philosophies of Optimization
Molly Rocket
93K views • 5 years ago
59:21A Crash Course in Modern Hardware by Cliff Click
Devoxx
21K views • 9 years ago
38:20Twitter and Visual Studio Rant
Molly Rocket
158K views • 6 years ago
35:42Progressive Performance (Chrome Dev Summit 2016)
Chrome for Developers
34K views • 9 years ago
1:00:58CppCon 2017: Chandler Carruth “Going Nowhere Faster”
CppCon
113K views • 9 years ago
![Bryan Cantrill on ARC: A Self-Tuning, Low Overhead Replacement Cache [PWL SF] 10/2017](https://i.ytimg.com/vi/F8sZRBdmqc0/hq2.jpg)
1:47:35Bryan Cantrill on ARC: A Self-Tuning, Low Overhead Replacement Cache [PWL SF] 10/2017
PapersWeLove
13K views • 9 years ago
1:48:55The Thirty Million Line Problem
Molly Rocket
326K views • 8 years ago
47:34RailsConf 2011: Aaron Patterson, "Double Dream Hands: So Intense!"
O'Reilly
26K views • 15 years ago
40:34Charlie Marsh: uv: An Extremely Fast Python Package Manager
Jane Street
107K views • 2 years ago
30:37High-performance Tree Wrangling, the APL Way // Aaron Hsu // Dyalog '18
Dyalog User Meetings
6K views • 7 years ago
4 comments from Hacker News
Quick google yields very good examples in huge improvements on a single algorithm level: ▶ this video Easy to imagine how even smaller improvements across 10-100 steps of data processing, can become even better.
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) ▶ this video
> 'Drastically' in this context can mean the slower approach taking billions of times longer. Standupmaths - "Someone improved my code by 40,832,277,770%": ▶ this video (OK, 41 billion percent is only 0.41 billion times better, but still.)
See also “Someone improved my code by 40,832,277,770%” < ▶ this video > by Matt Parker. It can be a really fun game!