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 13, 2026 14:19olliecrowolliecrowScore: 62,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 14:1962,45743,192,96421,100,0002,009,0002,396,160
2Mar 13, 2026 14:1962,65945,916,03021,168,0002,016,0002,396,160
3Mar 13, 2026 14:1962,83848,146,98121,229,0002,021,0002,404,352