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 14:13IlyaIlyaScore: 59,291Success
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 14:1458,78631,351,26420,636,0001,115,0002,113,536
2Jul 7, 2026 14:1458,92131,504,05720,657,0001,144,0002,113,536
3Jul 7, 2026 14:1459,21331,513,32720,721,0001,188,0002,113,536
4Jul 7, 2026 14:1459,23731,617,62020,706,0001,212,0002,113,536
5Jul 7, 2026 14:1459,29131,530,09320,645,0001,293,0002,113,536
6Jul 7, 2026 14:1459,30232,189,74420,715,0001,227,0002,113,536
7Jul 7, 2026 14:1459,33731,646,59620,703,0001,252,0002,113,536
8Jul 7, 2026 14:1459,37031,659,81020,821,0001,146,0002,113,536
9Jul 7, 2026 14:1461,50845,761,04821,552,0001,206,0002,113,536