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 15, 2026 20:23M-RochatM-RochatScore: 211,883Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 20:23210,68186,699,07229,413,00048,539,0002,113,536
2May 15, 2026 20:23211,88387,055,36229,527,00048,870,0002,113,536
3May 15, 2026 20:23214,72188,542,59029,108,00050,339,0002,113,536