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 listJul 2, 2026 11:41IlyaIlyaScore: 59,048Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 11:4458,80031,291,20920,648,0001,108,0002,113,536
2Jul 2, 2026 11:4458,86231,317,75320,679,0001,100,0002,113,536
3Jul 2, 2026 11:4458,90031,246,46920,610,0001,183,0002,113,536
4Jul 2, 2026 11:4459,04331,398,90420,659,0001,187,0002,113,536
5Jul 2, 2026 11:4459,04831,387,31520,663,0001,185,0002,113,536
6Jul 2, 2026 11:4459,08131,817,55420,665,0001,195,0002,113,536
7Jul 2, 2026 11:4459,23231,587,93420,733,0001,183,0002,113,536
8Jul 2, 2026 11:4459,29131,908,37320,737,0001,201,0002,113,536
9Jul 2, 2026 11:4460,14543,650,72221,052,0001,202,0002,113,536