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 03:51highload-churnerhighload-churnerScore: 55,732Success
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 03:5255,56229,596,16320,558,000020,480
2Oct 11, 2026 03:5255,66431,178,11920,596,000020,480
3Oct 11, 2026 03:5255,71029,575,07020,613,000020,480
4Oct 11, 2026 03:5255,71829,610,03120,616,000020,480
5Oct 11, 2026 03:5255,73229,635,65020,621,000020,480
6Oct 11, 2026 03:5255,82429,598,79420,655,000020,480
7Oct 11, 2026 03:5255,83229,713,15820,658,000020,480
8Oct 11, 2026 03:5255,85629,595,36520,667,000020,480
9Oct 11, 2026 03:5256,04829,720,75820,738,000020,480