Skip to content

reinerp/hashed-sorting-benchmark

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

21 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Hashed sorting benchmark

Benchmarks for the following problem statement: you have a large array of mostly-unique uint64s, and you want to know how many unique values there are.

We try many hash table solutions and many sorting solutions. See the main blog post for discussion.

Running benchmarks

Install a recent nightly version of Rust using rustup. Then

./run.sh

About

Benchmark hash tables vs hashed sorting

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published