Recent submissions

Comment · 7 days ago
The real competitors to a Btree like data structure are trie based structures, such as burst tries, (optimised) q-fast and p-fast tries, level compressed tries, bucketed tries, path compressed tries, etc

Also optimised stratified trees (van emde boas) implementations where key length permits.

Full comparison based structures are rarely necessary: ints, floats, strings, etc can be dealt with by lexicographic structures

Tries in particular work outrageously well on (unrealistic) uniform random data with log-logarithmic operation times

As a result, I’m skeptical of “fastest” here

B trees are great though, good work!

Comment · 1 year ago
I wonder if you can clear up a memory of mine from IOI 2001. The first day results were delayed, and I seem to remember this is because a contestant encoded the search in one of the problems into a compile time c++ template metaprogram. On the second day, there was then also a compile time limit for solutions, from what I remember. Do you remember any more details of this?
Comment · 1 year ago
Comment · 1 year ago
Comment · 2 years ago
Comment · 2 years ago
Comment · 2 years ago
Comment · 2 years ago
Comment · 3 years ago
ASYMPTOTA.COM (Dubai, ON-SITE)

Looking for exceptional quant-trader to join our highly successful HFT firm.

You’ll be joining a small, fun, highly collaborative team with deep experience in the most competitive trades on the planet.

Feel free to drop me a line with informal questions, as well as to apply: [email protected]

Comment · 3 years ago
Comment · 3 years ago
Comment · 3 years ago

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton