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 05:19highload-churnerhighload-churnerScore: 55,521Success
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 05:2055,32429,450,50820,470,000020,480
2Oct 11, 2026 05:2055,34329,450,20020,477,000020,480
3Oct 11, 2026 05:2055,34829,413,79320,479,000020,480
4Oct 11, 2026 05:2055,45629,473,71820,519,000020,480
5Oct 11, 2026 05:2055,52129,510,55720,543,000020,480
6Oct 11, 2026 05:2055,55929,510,45020,557,000020,480
7Oct 11, 2026 05:2055,57531,028,58320,563,000020,480
8Oct 11, 2026 05:2055,60029,535,12420,572,000020,480
9Oct 11, 2026 05:2056,15629,817,30120,778,000020,480