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 20:47IlyaIlyaScore: 59,932Success
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 20:4859,65631,563,10620,960,0001,113,0002,113,536
2Jun 29, 2026 20:4859,70231,541,48920,991,0001,099,0002,113,536
3Jun 29, 2026 20:4859,74031,528,09821,011,0001,093,0002,113,536
4Jun 29, 2026 20:4859,77831,550,36220,980,0001,138,0002,113,536
5Jun 29, 2026 20:4859,93231,653,75920,979,0001,196,0002,113,536
6Jun 29, 2026 20:4859,96731,582,81321,071,0001,117,0002,113,536
7Jun 29, 2026 20:4860,10231,666,78521,048,0001,190,0002,113,536
8Jun 29, 2026 20:4860,12432,194,85521,032,0001,214,0002,113,536
9Jun 29, 2026 20:4860,34032,291,72421,092,0001,234,0002,113,536