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 03:15Victor MerckléVictor MerckléScore: 58,345Success
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 03:1658,18928,955,31620,511,0001,019,0002,113,536
2Jun 25, 2026 03:1658,19728,967,22920,510,0001,023,0002,113,536
3Jun 25, 2026 03:1658,21029,050,16120,501,0001,037,0002,113,536
4Jun 25, 2026 03:1658,21830,472,39520,508,0001,033,0002,113,536
5Jun 25, 2026 03:1658,34529,065,58920,576,0001,012,0002,113,536
6Jun 25, 2026 03:1658,35629,060,16320,583,0001,009,0002,113,536
7Jun 25, 2026 03:1658,37529,062,52920,575,0001,024,0002,113,536
8Jun 25, 2026 03:1658,44029,550,76420,612,0001,011,0002,113,536
9Jun 25, 2026 03:1658,45429,080,26320,584,0001,044,0002,113,536