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 11, 2026 07:18highload-churnerhighload-churnerScore: 55,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2026 07:1955,15129,475,20120,406,000020,480
2Oct 11, 2026 07:1955,18129,444,46120,417,000020,480
3Oct 11, 2026 07:1955,18630,014,63620,419,000020,480
4Oct 11, 2026 07:1955,20229,372,79620,425,000020,480
5Oct 11, 2026 07:1955,29129,462,40320,458,000020,480
6Oct 11, 2026 07:1955,31029,372,96020,465,000020,480
7Oct 11, 2026 07:1955,32930,020,15920,472,000020,480
8Oct 11, 2026 07:1955,35929,541,69320,483,000020,480
9Oct 11, 2026 07:1955,44829,544,96420,516,000020,480