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:55Victor MerckléVictor MerckléScore: 3,278,575Success
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:563,277,5861,228,220,8711,210,708,0001,999,0002,342,912stderr
2Apr 27, 2026 14:563,277,6451,228,455,8071,209,730,0002,999,0002,482,176stderr
3Apr 27, 2026 14:563,277,8671,228,293,9601,210,812,0001,999,0002,486,272stderr
4Apr 27, 2026 14:563,278,1911,229,900,4531,211,932,000999,0002,473,984stderr
5Apr 27, 2026 14:563,278,5751,236,423,1931,211,075,0001,998,0002,486,272stderr
6Apr 27, 2026 14:563,280,7001,232,955,0201,211,860,0001,999,0002,318,336stderr
7Apr 27, 2026 14:563,281,4561,232,497,5241,211,142,0002,997,0002,322,432stderr
8Apr 27, 2026 14:563,281,8811,236,209,5511,211,298,0002,998,0002,560,000stderr
9Apr 27, 2026 14:563,284,8181,230,338,0861,212,385,0002,998,0002,482,176stderr