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 12, 2026 01:05Victor MerckléVictor MerckléScore: 65,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 01:0664,84333,108,29322,979,0001,013,0002,113,536
2May 12, 2026 01:0664,91835,422,47523,018,0001,002,0002,113,536
3May 12, 2026 01:0665,12433,411,61322,989,0001,107,0002,113,536
4May 12, 2026 01:0665,18132,913,35823,017,0001,100,0002,113,536
5May 12, 2026 01:0665,23234,333,48523,056,0001,080,0002,113,536
6May 12, 2026 01:0665,29433,811,04123,060,0001,099,0002,113,536
7May 12, 2026 01:0665,58937,890,20423,176,0001,092,0002,113,536
8May 12, 2026 01:0665,61333,056,37923,182,0001,095,0002,113,536
9May 12, 2026 01:0665,67835,292,73523,200,0001,101,0002,113,536