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 listApr 1, 2026 21:22olliecrowolliecrowScore: 72,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 21:2272,61950,796,00724,879,0001,990,0002,469,888
2Apr 1, 2026 21:2272,93251,739,57124,987,0001,998,0002,265,088
3Apr 1, 2026 21:2273,65149,862,10125,233,0002,018,0002,486,272