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 21:45Victor MerckléVictor MerckléScore: 65,643Success
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 21:4765,24334,461,86723,038,0001,102,0002,113,536
2May 11, 2026 21:4765,36734,890,27523,119,0001,067,0002,113,536
3May 11, 2026 21:4765,44032,981,99523,145,0001,068,0002,113,536
4May 11, 2026 21:4765,54033,168,23923,096,0001,154,0002,113,536
5May 11, 2026 21:4765,64334,436,64823,153,0001,135,0002,113,536
6May 11, 2026 21:4765,85934,908,76223,276,0001,092,0002,113,536
7May 11, 2026 21:4765,87533,118,55523,266,0001,108,0002,113,536
8May 11, 2026 21:4766,05635,124,42723,282,0001,159,0002,113,536
9May 11, 2026 21:4766,07533,308,64423,302,0001,146,0002,113,536