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 22:06olliecrowolliecrowScore: 101,700Success
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 22:06100,76258,679,11434,260,0003,022,0002,412,544
2Mar 20, 2026 22:06101,70068,778,84435,595,0002,034,0002,396,160
3Mar 20, 2026 22:06102,29764,791,97534,862,0002,988,0002,342,912