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 13:28IlyaIlyaScore: 62,410Success
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 13:2961,90232,389,52321,797,0001,107,0002,113,536
2Jun 29, 2026 13:2962,18632,502,51221,838,0001,171,0002,113,536
3Jun 29, 2026 13:2962,29732,626,82121,908,0001,142,0002,113,536
4Jun 29, 2026 13:2962,37532,958,47421,882,0001,197,0002,113,536
5Jun 29, 2026 13:2962,41033,040,00021,891,0001,201,0002,113,536
6Jun 29, 2026 13:2962,42733,003,29121,890,0001,208,0002,113,536
7Jun 29, 2026 13:2962,47533,064,86721,918,0001,198,0002,113,536
8Jun 29, 2026 13:2962,57832,705,13021,920,0001,234,0002,113,536
9Jun 29, 2026 13:2962,63733,145,05021,980,0001,196,0002,113,536