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 listMar 22, 2026 17:21Dominique GarmierDominique GarmierScore: 116,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 19:31115,96869,399,00640,913,0001,995,0002,293,760
2Mar 22, 2026 17:21116,06865,222,14440,948,0001,997,0002,334,720
3Mar 22, 2026 19:31116,36576,214,70040,052,0003,003,0002,371,584
4Mar 22, 2026 19:31116,41471,780,11841,070,0002,003,0002,543,616
5Mar 22, 2026 17:21116,75765,341,74041,191,0002,009,0002,547,712
6Mar 22, 2026 17:21117,33266,198,18740,385,0003,028,0002,334,720