The One Billion Row Challenge in Go: from 1m45s to 3.4s in nine solutions
How I solved the One Billion Row Challenge (1BRC) in Go nine times, from a simple unoptimised version that takes 1 minute 45 seconds, to an optimised and parallelised version that takes 3.4 seconds.
The One Billion Row Challenge in Go: from 1m45s to 3.4s in nine solutions Ben Hoyt Home Resume/CV Projects Tech Writing Non-Tech Email benhoyt.com benhoyt@gmail.com The One Billion Row Challenge in Go: from 1m45s to 3.4s in nine solutions March 2024 Go to: Baseline | Solutions | Table of results | Final comments I saw the One Billion Row Challenge a couple of weeks ago, and it thoroughly nerd-sniped me, so I went to Go solve it. I’m late to the party, as the original competition was in January. It was also in Java. I’m not particularly interested in Java, but I’ve been interested in optimising
saved by
related reading
- Making a Go program run 1.7x faster with a one character change • Harry Marrhmarr.com
- How to Optimize a CUDA Matmul Kernel for cuBLAS-like Performance: a Worklogsiboehm.com
- abseil / Performance Hintsabseil.io
- Crawling a billion web pages in just over 24 hoursandrewkchan.dev
- There's no reason for software to be slow anymoredanluu.com
- CRDTs go brrrjosephg.com
- Static search trees: 40x faster than binary search · CuriousCodingcuriouscoding.nl
- Analyzing Data 180,000x Faster with Rustwillcrichton.net
- Squeezing a sokoban game into 10 lines of codecole-k.com
- Auto-research with codex: How I achieved a 232x Faster Kernel over baseline with Codex in GPU Mode's qr_v2 problemsankalp.bearblog.dev
- cbloom rantscbloomrants.blogspot.com
- There's no reason for software to be slow anymoredanluu.com