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 3, 2026 07:41IlyaIlyaScore: 60,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 07:4259,85131,596,32421,026,0001,119,0002,113,536
2Jul 3, 2026 07:4259,90031,586,31321,042,0001,121,0002,113,536
3Jul 3, 2026 07:4259,90831,634,29621,077,0001,089,0002,113,536
4Jul 3, 2026 07:4260,00231,691,86521,085,0001,116,0002,113,536
5Jul 3, 2026 07:4260,13731,808,64121,070,0001,181,0002,113,536
6Jul 3, 2026 07:4260,18931,830,97321,049,0001,221,0002,113,536
7Jul 3, 2026 07:4260,20831,857,78021,119,0001,158,0002,113,536
8Jul 3, 2026 07:4260,27031,874,83421,108,0001,192,0002,113,536
9Jul 3, 2026 07:4260,62432,497,62421,200,0001,231,0002,113,536