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 listMay 11, 2026 20:21Victor MerckléVictor MerckléScore: 64,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:2264,42133,956,44322,828,0001,008,0002,113,536
2May 11, 2026 20:2264,62934,920,09922,894,0001,019,0002,113,536
3May 11, 2026 20:2264,63534,644,37522,827,0001,088,0002,113,536
4May 11, 2026 20:2264,70834,889,71622,841,0001,101,0002,113,536
5May 11, 2026 20:2264,72935,115,04322,869,0001,081,0002,113,536
6May 11, 2026 20:2264,77535,723,01722,870,0001,097,0002,113,536
7May 11, 2026 20:2264,94034,128,43123,006,0001,022,0002,113,536
8May 11, 2026 20:2264,95932,771,11823,018,0001,017,0002,113,536
9May 11, 2026 20:2265,02432,829,21023,018,0001,041,0002,113,536