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 listMay 11, 2026 16:24Victor MerckléVictor MerckléScore: 76,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:2576,42938,255,49227,114,0001,165,0002,113,536
2May 11, 2026 16:2576,54337,505,24327,144,0001,177,0002,113,536
3May 11, 2026 16:2576,64339,023,84027,213,0001,145,0002,113,536
4May 11, 2026 16:2576,74337,665,30527,216,0001,179,0002,113,536
5May 11, 2026 16:2576,74337,684,85527,247,0001,148,0002,113,536
6May 11, 2026 16:2576,82137,131,81427,217,0001,207,0002,113,536
7May 11, 2026 16:2576,90839,100,07027,290,0001,166,0002,113,536
8May 11, 2026 16:2577,14838,109,72227,391,0001,154,0002,113,536
9May 11, 2026 16:2577,28937,342,39427,435,0001,162,0002,113,536