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 30, 2026 13:18IlyaIlyaScore: 86,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 13:2085,54841,121,14530,503,0001,150,0002,113,536
2Jun 30, 2026 13:2085,59441,108,12630,568,0001,102,0002,113,536
3Jun 30, 2026 13:2086,27241,365,08330,819,0001,102,0002,113,536
4Jun 30, 2026 13:2086,46741,467,05330,885,0001,108,0002,113,536
5Jun 30, 2026 13:2086,57041,527,03030,826,0001,205,0002,113,536
6Jun 30, 2026 13:2086,64541,518,64030,956,0001,103,0002,113,536
7Jun 30, 2026 13:2086,71842,207,88730,882,0001,204,0002,113,536
8Jun 30, 2026 13:2086,84541,591,11530,955,0001,178,0002,113,536
9Jun 30, 2026 13:2086,88341,629,28430,981,0001,166,0002,113,536