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 listSep 20, 2026 15:07Andrew EpsteinAndrew EpsteinScore: 56,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2026 15:0855,85629,477,91320,667,000020,480
2Sep 20, 2026 15:0855,92429,294,30220,692,000020,480
3Sep 20, 2026 15:0855,93729,519,17920,697,000020,480
4Sep 20, 2026 15:0855,98929,583,19120,716,000020,480
5Sep 20, 2026 15:0856,06429,537,43920,744,000020,480
6Sep 20, 2026 15:0856,07029,622,86620,746,000020,480
7Sep 20, 2026 15:0856,10229,508,52420,758,000020,480
8Sep 20, 2026 15:0856,11029,608,01720,761,000020,480
9Sep 20, 2026 15:0856,13529,584,93720,770,000020,480