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 listSep 25, 2026 21:20Kevin HeaveyKevin HeaveyScore: 53,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 21:2253,65128,574,86119,851,000020,480
2Sep 25, 2026 21:2253,65628,642,82019,853,000020,480
3Sep 25, 2026 21:2253,77528,686,28419,897,000020,480
4Sep 25, 2026 21:2253,80828,751,51419,909,000020,480
5Sep 25, 2026 21:2253,81028,650,17819,910,000020,480
6Sep 25, 2026 21:2253,81328,706,03819,911,000020,480
7Sep 25, 2026 21:2253,84528,685,75719,923,000020,480
8Sep 25, 2026 21:2253,85928,741,92519,928,000020,480
9Sep 25, 2026 21:2254,07028,810,99520,006,000020,480