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 listAug 14, 2026 22:00Tomislav TunkovicTomislav TunkovicScore: 59,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 22:0159,65930,538,45722,074,00002,113,536
2Aug 14, 2026 22:0159,72730,486,10421,093,0001,006,0002,113,536
3Aug 14, 2026 22:0159,78330,506,56121,081,0001,039,0002,113,536
4Aug 14, 2026 22:0159,79130,542,59121,119,0001,004,0002,113,536
5Aug 14, 2026 22:0159,97230,929,96421,188,0001,002,0002,113,536
6Aug 14, 2026 22:0160,03530,633,41321,174,0001,039,0002,113,536
7Aug 14, 2026 22:0160,04030,522,32621,207,0001,008,0002,113,536
8Aug 14, 2026 22:0160,04830,674,82421,215,0001,003,0002,113,536
9Aug 14, 2026 22:0160,18630,681,55821,260,0001,009,0002,113,536