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 25, 2026 18:36IlyaIlyaScore: 77,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 18:3770,59435,335,87725,004,0001,116,0002,113,536
2Jun 25, 2026 18:3777,31337,882,42727,421,0001,185,0002,113,536
3Jun 25, 2026 18:3777,33737,904,91327,490,0001,125,0002,113,536
4Jun 25, 2026 18:3777,45438,291,40327,455,0001,203,0002,113,536
5Jun 25, 2026 18:3777,58637,960,46827,515,0001,192,0002,113,536
6Jun 25, 2026 18:3777,74037,967,93727,628,0001,136,0002,113,536
7Jun 25, 2026 18:3777,85639,190,74627,677,0001,130,0002,113,536
8Jun 25, 2026 18:3778,19138,580,31627,712,0001,219,0002,113,536
9Jun 25, 2026 18:3778,21838,699,79727,850,0001,091,0002,113,536