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 15:47highload-churnerhighload-churnerScore: 55,283Success
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 15:4755,10529,285,03020,389,000020,480
2Oct 12, 2026 15:4755,21029,344,73020,428,000020,480
3Oct 12, 2026 15:4755,22729,300,73620,434,000020,480
4Oct 12, 2026 15:4755,25129,090,24520,443,000020,480
5Oct 12, 2026 15:4755,28329,328,52020,455,000020,480
6Oct 12, 2026 15:4755,38329,233,79220,492,000020,480
7Oct 12, 2026 15:4755,44029,297,80020,513,000020,480
8Oct 12, 2026 15:4755,44529,421,42620,515,000020,480
9Oct 12, 2026 15:4756,00832,383,68220,723,000020,480