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
Explore this link on the map →saved by
related reading
- abseil / Performance Hintsabseil.io
- Frequently Asked Questions (FAQ) - The Go Programming Languagego.dev
- Go go-to guide · YourBasicyourbasic.org
- Four Days of Go – Evan Millerevanmiller.org
- Making a Go program run 1.7x faster with a one character change • Harry Marrhmarr.com
- Go at Google: Language Design in the Service of Software Engineering - The Go Programming Languagego.dev
- Effective Go - The Go Programming Languagego.dev
- abseil / Performance Hintsabseil.io
- Notes on structured concurrency, or: Go statement considered harmful - njs blogvorpus.org
- NilAway: Practical Nil Panic Detection for Gouber.com
- Data Race Detector - The Go Programming Languagego.dev
- The Go Memory Model - The Go Programming Languagego.dev