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 listMar 20, 2026 17:43olliecrowolliecrowScore: 102,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 17:43102,46266,413,19935,916,0001,995,0002,449,408
2Mar 20, 2026 17:43102,47058,839,77035,919,0001,995,0002,445,312
3Mar 20, 2026 17:43103,21963,545,74636,127,0002,064,0002,498,560