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 9, 2026 13:18highload-churnerhighload-churnerScore: 58,248Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 13:1957,78330,295,64220,370,0001,010,00020,480
2Oct 9, 2026 13:1957,85430,319,31220,376,0001,030,00020,480
3Oct 9, 2026 13:1957,92730,397,37320,418,0001,015,00020,480
4Oct 9, 2026 13:1957,93230,329,41020,425,0001,010,00020,480
5Oct 9, 2026 13:1958,24830,529,44720,542,0001,010,00020,480
6Oct 9, 2026 13:1958,74330,703,70620,720,0001,015,00020,480
7Oct 9, 2026 13:1958,81330,691,28920,728,0001,033,00020,480
8Oct 9, 2026 13:1958,85630,723,61520,761,0001,016,00020,480
9Oct 9, 2026 13:1959,08330,857,21120,825,0001,036,00020,480