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 7, 2026 13:47IlyaIlyaScore: 59,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 13:4859,74031,717,42620,968,0001,136,0002,113,536
2Jul 7, 2026 13:4859,78331,766,12020,937,0001,183,0002,113,536
3Jul 7, 2026 13:4859,81031,881,96621,001,0001,129,0002,113,536
4Jul 7, 2026 13:4859,83231,822,97720,944,0001,194,0002,113,536
5Jul 7, 2026 13:4859,85131,965,10520,950,0001,195,0002,113,536
6Jul 7, 2026 13:4859,96431,895,22121,056,0001,131,0002,113,536
7Jul 7, 2026 13:4860,12732,110,90721,049,0001,198,0002,113,536
8Jul 7, 2026 13:4860,14032,486,02621,024,0001,228,0002,113,536
9Jul 7, 2026 13:4860,19132,514,37420,978,0001,293,0002,113,536