urschrei.eurosky.social / cvmcount
Rust implementation of the CVM algorithm for counting distinct elements in a stream
0
Fork 0

Configure Feed

Select the types of activity you want to include in your feed.

Update README

author
Stephan Hügel date (Mar 3, 2025, 3:20 PM UTC) commit 9df59ced parent 93e146f1
+1 -1
+1 -1
README.md
··· 60 60 ``` 61 61 62 62 ## Note 63 - If you're thinking about using this library, you presumably know that it only provides an estimate (within the specified bounds), similar to something like HyperLogLog. You are trading accuracy for speed! 63 + If you're thinking about using this library, you presumably know that it only provides an estimate (within the specified bounds), similar to something like HyperLogLog. You are trading accuracy for speed and memory usage! 64 64 65 65 ## Perf 66 66 Calculating the unique tokens in a [418K UTF-8 text file](https://www.gutenberg.org/ebooks/8492) using the CLI takes 7.2 ms ± 0.3 ms on an M2 Pro. Counting 10e6 7-digit integers takes around 13.5 ms. An exact count using the same regex and HashSet runs in around 18 ms. Run `cargo bench` for more.