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 listApr 27, 2026 14:59Victor MerckléVictor MerckléScore: 3,279,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 14:593,278,0131,231,477,5851,209,866,0002,999,0002,473,984stderr
2Apr 27, 2026 14:593,278,1701,232,242,2291,211,924,000999,0002,478,080stderr
3Apr 27, 2026 14:593,278,4101,233,404,3531,211,012,0002,000,0002,478,080stderr
4Apr 27, 2026 14:593,278,4831,235,178,1781,210,042,0002,997,0002,322,432stderr
5Apr 27, 2026 14:593,279,5811,227,922,5951,210,447,0002,998,0002,473,984stderr
6Apr 27, 2026 14:593,280,7941,233,574,6371,212,895,000999,0002,494,464stderr
7Apr 27, 2026 14:593,280,8831,229,320,3591,212,928,000999,0002,318,336stderr
8Apr 27, 2026 14:593,281,1241,232,485,9411,210,016,0004,000,0002,478,080stderr
9Apr 27, 2026 14:597,713,9622,873,037,4232,851,168,0002,998,0002,482,176stderr