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 19:15olliecrowolliecrowScore: 101,649Success
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 19:15101,54364,434,92036,556,0001,015,0002,297,856
2Mar 20, 2026 19:15101,64962,301,64636,594,0001,016,0002,433,024
3Mar 20, 2026 19:15102,52466,967,37934,940,0002,994,0002,437,120