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 14:42IlyaIlyaScore: 68,145Success
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 14:4367,98134,648,91624,048,0001,105,0002,113,536
2Jun 29, 2026 14:4368,09435,197,83123,991,0001,204,0002,113,536
3Jun 29, 2026 14:4368,12135,154,27824,004,0001,201,0002,113,536
4Jun 29, 2026 14:4368,13234,744,84923,997,0001,212,0002,113,536
5Jun 29, 2026 14:4368,14535,154,31524,013,0001,201,0002,113,536
6Jun 29, 2026 14:4368,34835,422,20224,072,0001,217,0002,113,536
7Jun 29, 2026 14:4368,50835,286,09224,139,0001,209,0002,113,536
8Jun 29, 2026 14:4368,56735,357,51924,132,0001,238,0002,113,536
9Jun 29, 2026 14:4368,61635,319,05124,188,0001,200,0002,113,536