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 13, 2026 08:19highload-churnerhighload-churnerScore: 54,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 08:2054,57229,163,73020,192,000020,480
2Oct 13, 2026 08:2054,57829,107,98720,194,000020,480
3Oct 13, 2026 08:2054,66229,120,63020,225,000020,480
4Oct 13, 2026 08:2054,68329,142,98320,233,000020,480
5Oct 13, 2026 08:2054,70029,159,10220,239,000020,480
6Oct 13, 2026 08:2054,75929,123,86620,261,000020,480
7Oct 13, 2026 08:2054,79129,195,46420,273,000020,480
8Oct 13, 2026 08:2054,81629,206,40120,282,000020,480
9Oct 13, 2026 08:2055,03229,260,90720,362,000020,480