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 8, 2026 23:24IlyaIlyaScore: 58,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 23:2558,31331,248,03320,473,0001,103,0002,113,536
2Jul 8, 2026 23:2558,33531,216,50820,473,0001,111,0002,113,536
3Jul 8, 2026 23:2558,33731,229,83620,464,0001,121,0002,113,536
4Jul 8, 2026 23:2558,43531,949,21220,469,0001,152,0002,113,536
5Jul 8, 2026 23:2558,47831,293,57320,535,0001,102,0002,113,536
6Jul 8, 2026 23:2558,52731,485,39120,525,0001,130,0002,113,536
7Jul 8, 2026 23:2558,94531,518,52120,758,0001,052,0002,113,536
8Jul 8, 2026 23:2558,96431,461,85420,766,0001,051,0002,113,536
9Jul 8, 2026 23:2521,626,0838,013,425,2907,852,433,000149,218,0002,113,536