TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listJun 25, 2026 00:50Victor MerckléVictor MerckléScore: 58,581Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 00:5158,28628,971,70221,566,00002,113,536
2Jun 25, 2026 00:5158,37529,010,72721,599,00002,113,536
3Jun 25, 2026 00:5158,51329,102,37220,628,0001,022,0002,113,536
4Jun 25, 2026 00:5158,53729,126,44221,659,00002,113,536
5Jun 25, 2026 00:5158,58129,160,76320,664,0001,011,0002,113,536
6Jun 25, 2026 00:5158,59729,163,68620,676,0001,005,0002,113,536
7Jun 25, 2026 00:5158,62929,701,33320,656,0001,037,0002,113,536
8Jun 25, 2026 00:5158,86229,356,01820,743,0001,036,0002,113,536
9Jun 25, 2026 00:51617,564236,213,794228,499,00002,113,536