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 14:05highload-churnerhighload-churnerScore: 59,013Success
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 14:0857,89430,357,83520,404,0001,017,00020,480
2Oct 9, 2026 14:0858,48630,601,24620,629,0001,011,00020,480
3Oct 9, 2026 14:0858,58930,593,30820,667,0001,011,00020,480
4Oct 9, 2026 14:0858,74330,663,12420,725,0001,010,00020,480
5Oct 9, 2026 14:0859,01331,470,44720,824,0001,011,00020,480
6Oct 9, 2026 14:0859,02130,821,57220,823,0001,015,00020,480
7Oct 9, 2026 14:0859,02130,893,85420,808,0001,030,00020,480
8Oct 9, 2026 14:0859,02930,778,69420,824,0001,017,00020,480
9Oct 9, 2026 14:0859,07030,762,42220,840,0001,016,00020,480