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 24, 2026 23:14Victor MerckléVictor MerckléScore: 58,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:1558,65429,159,37521,702,00002,113,536
2Jun 24, 2026 23:1558,73229,165,13921,731,00002,113,536
3Jun 24, 2026 23:1558,77029,284,51920,732,0001,013,0002,113,536
4Jun 24, 2026 23:1558,81029,602,71920,742,0001,018,0002,113,536
5Jun 24, 2026 23:1558,85129,276,96720,744,0001,031,0002,113,536
6Jun 24, 2026 23:1558,86429,801,34320,744,0001,036,0002,113,536
7Jun 24, 2026 23:1558,95629,338,62120,760,0001,054,0002,113,536
8Jun 24, 2026 23:1558,98929,504,61920,799,0001,027,0002,113,536
9Jun 24, 2026 23:1559,04829,339,99620,842,0001,006,0002,113,536