1brc
hyperfine
1brc | hyperfine | |
---|---|---|
28 | 75 | |
5,246 | 20,182 | |
- | - | |
9.8 | 8.1 | |
24 days ago | 17 days ago | |
Java | Rust | |
Apache License 2.0 | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
1brc
-
The One Billion Row Challenge in CUDA: from 17 minutes to 17 seconds
This would be the code to beat. Ideally with only 8 cores but any number of cores is also very interesting.
https://github.com/gunnarmorling/1brc/discussions/710
-
One Billion Row Challenge in Golang - From 95s to 1.96s
Given that 1-billion-line-file is approximately 13GB, instead of providing a fixed database, the official repository offers a script to generate synthetic data with random readings. Just follow the instructions to create your own database.
-
1BRC Merykitty's Magic SWAR: 8 Lines of Code Explained in 3k Words
Local disk I/O is no longer the bottleneck on modern systems: https://benhoyt.com/writings/io-is-no-longer-the-bottleneck/
In addition, the official 1BRC explicitly evaluated results on a RAM disk to avoid I/O speed entirely: https://github.com/gunnarmorling/1brc?tab=readme-ov-file#eva... "Programs are run from a RAM disk (i.o. the IO overhead for loading the file from disk is not relevant)"
-
Processing One Billion Rows in PHP!
You may have heard of the "The One Billion Row Challenge" (1brc) and in case you don't, go checkout Gunnar Morlings's 1brc repo.
-
The One Billion Row Challenge in Go: from 1m45s to 4s in nine solutions
Here’s a thread on results with duckdb, I don’t mean to discourage you taking a shot at all though: https://github.com/gunnarmorling/1brc/discussions/39
-
Ask HN: How can I learn about performance optimization?
If you are in “javaland” look at billion row challenge, you will learn a lot - https://github.com/gunnarmorling/1brc
- Lessons Learned from Doing the One Billion Row Challenge
- 1B Row Challenge Shows Java Can Process 1B Rows File in 2 Seconds
-
From slow to SIMD: A Go optimization story
Even manual vectorization is pain...writing ASM, really?
Rust has unstable portable SIMD and a few third-party crates, C++ has that as well, C# has stable portable SIMD and a very small BLAS-like library on top of it (hell it even exercises PackedSIMD when ran in a browser) and Java is getting stable Panama vectors some time in the future (though the question of codegen quality stands open given planned changes to unsafe API).
Go among these is uniquely disadvantaged. And if that's not enough, you may want to visit 1Brc's challenge discussions and see that Go struggles get anywhere close to 2s mark with both C# and C++ are blazing past it:
https://hotforknowledge.com/2024/01/13/1brc-in-dotnet-among-...
https://github.com/gunnarmorling/1brc/discussions/67
-
JEP Draft: Deprecate Memory-Access Methods in Sun.misc.Unsafe for Removal
In terms of performance: I realize that this is a somewhat "toy" issue, and it's a sample size of 1, but for the currently ongoing "One Billion Row Challenge"[1] (an ongoing Java performance competition related to parsing and aggregating a 13 GB file), all of the current top-performers are using Unsafe. More specifically, the use of Unsafe appears to have been the change for a few entries that allowed getting below the 3-second barrier in the test.
1. https://github.com/gunnarmorling/1brc
hyperfine
-
Measuring startup and shutdown overhead of several code interpreters
Check out the official hyperfine Github repo
-
Bun - The One Tool for All Your JavaScript/Typescript Project's Needs?
And then I used hyperfine to run the benchmarks on my MacBook Pro 14 M2 Max, and here are the results:
-
Faster tetranucleotide (k-mer) frequencies!
Search "benchmarking tools for linux" and decide that hyperfine is good for what I'm doing. Run Jennifer's new python script against my refactored perl and find that the python is 1.26 times faster for k=3 and 1.47 times faster for k=4. For the Covid-19 sequence, these are both on the order of hundreds of milliseconds.
- Hyperfine: A command-line benchmarking tool
- FLaNK Weekly 08 Jan 2024
-
Show HN: Inshellisense – IDE style shell autocomplete
> It is very possible to write sub 100ms procedures in TS, […]
I will not disagree with this statement because I don’t have a way to test inshellisense right now. Could you (or anyone with a working Node + NPM installation) please install inshellisense and post the actual numbers? Perhaps using a tool like hyperfine (https://github.com/sharkdp/hyperfine).
-
Firefox has surpassed Chrome on Speedometer
Yeah, while it's not as thorough as these tools, the method is at least reproducible and sane, and with ~10 or so samples, you get an interval with a nice confidence.
Another through method will be hyperfine[0], yet I wanted to provide a method which requires no installation and can be done in a whim, without jumps and hoops, with the tools already at hand.
[0]: https://github.com/sharkdp/hyperfine
-
How to optimize your config? What are mistakes to avoid when optimizing your config?
That is native and inbuild but I would suggest below options instead 1. Using lazy's Profile tab instead https://github.com/folke/lazy.nvim 2. Using a dedicated plugin to do this https://github.com/dstein64/vim-startuptime. 3. Using an external program hyperfine is one that I use https://github.com/sharkdp/hyperfine
-
How to remove all <br> from all of my .html files
Fair enough, although might I recommend using hyperfine for your testing? ;p
What are some alternatives?
1brc - C99 implementation of the 1 Billion Rows Challenge. 1️⃣🐝🏎️ Runs in ~1.6 seconds on my not-so-fast laptop CPU w/ 16GB RAM.
criterion.rs - Statistics-driven benchmarking library for Rust
yolov7-object-tracking - YOLOv7 Object Tracking Using PyTorch, OpenCV and Sort Tracking
fd - A simple, fast and user-friendly alternative to 'find'
csvlens - Command line csv viewer
ripgrep - ripgrep recursively searches directories for a regex pattern while respecting your gitignore
nodejs - 1️⃣🐝🏎️ The One Billion Row Challenge with Node.js -- A fun exploration of how quickly 1B rows from a text file can be aggregated with different languages.
awesome-mac - Now we have become very big, Different from the original idea. Collect premium software in various categories.
pocketbase - Open Source realtime backend in 1 file
kubeconform - A FAST Kubernetes manifests validator, with support for Custom Resources!
Apache Arrow - Apache Arrow is a multi-language toolbox for accelerated data interchange and in-memory processing
quinn - Async-friendly QUIC implementation in Rust