Re:The Billion Row Challenge (1BRC) – Step-by-Step from 71s ...
by anonymoushn on Thursday February 22, 2024 @04:58PM
(#39473889)
Top solutions tend to use hashes that ignore many input bytes. Even if they did not, they would use hashes that consume 4 or 8 bytes of input at a time (you could do more if the language exposed aesenc)
[ Parent
| on HN ]
There are no comments on this comment yet.