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 19:34IlyaIlyaScore: 59,951Success
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 19:3559,47831,373,79820,909,0001,098,0002,113,536
2Jun 29, 2026 19:3559,82431,609,19720,942,0001,193,0002,113,536
3Jun 29, 2026 19:3559,82931,521,84420,942,0001,195,0002,113,536
4Jun 29, 2026 19:3559,84532,105,34120,925,0001,218,0002,113,536
5Jun 29, 2026 19:3559,95132,162,60220,972,0001,210,0002,113,536
6Jun 29, 2026 19:3560,11632,161,23721,029,0001,214,0002,113,536
7Jun 29, 2026 19:3560,14532,124,17121,041,0001,213,0002,113,536
8Jun 29, 2026 19:3560,17832,183,28521,033,0001,233,0002,113,536
9Jun 29, 2026 19:3560,39132,329,17921,267,0001,078,0002,113,536