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 4, 2026 23:09olliecrowolliecrowScore: 69,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 23:0969,83557,424,57024,846,000993,0002,281,472
2Mar 4, 2026 23:0969,97657,715,26925,891,00002,281,472
3Mar 4, 2026 23:0970,14950,374,78124,957,000998,0002,281,472