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 listJun 30, 2026 21:15IlyaIlyaScore: 59,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 21:1758,72931,187,40020,635,0001,095,0002,113,536
2Jun 30, 2026 21:1758,88131,291,09620,675,0001,111,0002,113,536
3Jun 30, 2026 21:1758,94031,291,07320,703,0001,105,0002,113,536
4Jun 30, 2026 21:1759,01331,257,37420,714,0001,121,0002,113,536
5Jun 30, 2026 21:1759,06431,763,40220,653,0001,201,0002,113,536
6Jun 30, 2026 21:1759,08331,784,13220,676,0001,185,0002,113,536
7Jun 30, 2026 21:1759,18932,787,00520,752,0001,148,0002,113,536
8Jun 30, 2026 21:1759,23231,390,27820,709,0001,207,0002,113,536
9Jun 30, 2026 21:1759,31831,895,47720,728,0001,220,0002,113,536