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 29, 2026 20:27IlyaIlyaScore: 60,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 20:2859,70031,481,97520,989,0001,100,0002,113,536
2Jun 29, 2026 20:2859,71831,567,87220,976,0001,120,0002,113,536
3Jun 29, 2026 20:2859,74531,602,33820,995,0001,111,0002,113,536
4Jun 29, 2026 20:2859,77831,673,28221,009,0001,109,0002,113,536
5Jun 29, 2026 20:2860,07231,707,96821,037,0001,190,0002,113,536
6Jun 29, 2026 20:2860,16732,175,06621,068,0001,194,0002,113,536
7Jun 29, 2026 20:2860,25431,743,31621,092,0001,202,0002,113,536
8Jun 29, 2026 20:2860,28131,826,20321,086,0001,218,0002,113,536
9Jun 29, 2026 20:2860,30231,891,08821,108,0001,204,0002,113,536