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:45highload-churnerhighload-churnerScore: 108,654Success
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:46108,31649,003,54340,077,000020,480
2Oct 12, 2026 13:46108,32448,956,45040,080,000020,480
3Oct 12, 2026 13:46108,44850,499,34740,126,000020,480
4Oct 12, 2026 13:46108,62449,059,67340,191,000020,480
5Oct 12, 2026 13:46108,65449,003,85240,202,000020,480
6Oct 12, 2026 13:46108,71849,135,97040,226,000020,480
7Oct 12, 2026 13:46108,71849,108,56040,226,000020,480
8Oct 12, 2026 13:46108,90549,049,34140,295,000020,480
9Oct 12, 2026 13:46109,09749,254,60740,366,000020,480