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 listOct 11, 2026 04:47highload-churnerhighload-churnerScore: 55,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2026 04:4855,51829,429,34620,542,000020,480
2Oct 11, 2026 04:4855,57529,557,51220,563,000020,480
3Oct 11, 2026 04:4855,65929,555,00620,594,000020,480
4Oct 11, 2026 04:4855,75429,508,41920,629,000020,480
5Oct 11, 2026 04:4855,78329,582,83720,640,000020,480
6Oct 11, 2026 04:4855,84029,669,02620,661,000020,480
7Oct 11, 2026 04:4855,88329,648,77320,677,000020,480
8Oct 11, 2026 04:4856,06729,614,99820,745,000020,480
9Oct 11, 2026 04:4856,10529,747,49620,759,000020,480