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 17:25highload-churnerhighload-churnerScore: 57,745Success
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 17:3057,49730,208,07220,254,0001,020,00020,480
2Oct 9, 2026 17:3057,54330,267,92020,281,0001,010,00020,480
3Oct 9, 2026 17:3057,60530,267,78020,301,0001,013,00020,480
4Oct 9, 2026 17:3057,70030,316,94120,330,0001,019,00020,480
5Oct 9, 2026 17:3057,74531,789,19620,355,0001,011,00020,480
6Oct 9, 2026 17:3057,74830,353,40720,355,0001,012,00020,480
7Oct 9, 2026 17:3057,75630,287,51720,358,0001,012,00020,480
8Oct 9, 2026 17:3057,78630,327,73420,371,0001,010,00020,480
9Oct 9, 2026 17:3057,79130,337,38620,368,0001,015,00020,480