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 26, 2026 19:10Kevin HeaveyKevin HeaveyScore: 53,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 19:3153,83529,914,31819,919,000020,480
2Sep 26, 2026 19:3153,85129,918,91019,925,000020,480
3Sep 26, 2026 19:3153,88130,296,24519,936,000020,480
4Sep 26, 2026 19:3153,92730,443,28019,953,000020,480
5Sep 26, 2026 19:3153,94330,310,22119,959,000020,480
6Sep 26, 2026 19:3154,00231,572,91219,981,000020,480
7Sep 26, 2026 19:3154,03730,126,60919,994,000020,480
8Sep 26, 2026 19:3154,10530,149,36820,019,000020,480
9Sep 26, 2026 19:3154,17830,342,30920,046,000020,480