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 18:05olliecrowolliecrowScore: 101,405Success
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 18:05100,28165,053,25034,096,0003,008,0002,347,008
2Mar 20, 2026 18:05101,40559,751,61936,506,0001,014,0002,441,216
3Mar 20, 2026 18:05101,79559,816,45335,629,0002,035,0002,449,408