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 12, 2026 13:57highload-churnerhighload-churnerScore: 55,113Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 13:5854,87529,178,51920,304,000020,480
2Oct 12, 2026 13:5855,03229,188,50120,362,000020,480
3Oct 12, 2026 13:5855,06730,797,90920,375,000020,480
4Oct 12, 2026 13:5855,07029,328,46320,376,000020,480
5Oct 12, 2026 13:5855,11329,232,08320,392,000020,480
6Oct 12, 2026 13:5855,16229,267,15020,410,000020,480
7Oct 12, 2026 13:5855,16729,362,13320,412,000020,480
8Oct 12, 2026 13:5855,22929,400,61120,435,000020,480
9Oct 12, 2026 13:5855,27229,361,07720,451,000020,480