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 30, 2026 21:31IlyaIlyaScore: 59,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 21:3359,01631,333,37120,733,0001,103,0002,113,536
2Jun 30, 2026 21:3359,18631,361,08920,799,0001,100,0002,113,536
3Jun 30, 2026 21:3359,29731,867,50220,744,0001,196,0002,113,536
4Jun 30, 2026 21:3359,45431,909,75420,775,0001,223,0002,113,536
5Jun 30, 2026 21:3359,46431,906,21920,794,0001,208,0002,113,536
6Jun 30, 2026 21:3359,47831,933,96920,777,0001,230,0002,113,536
7Jun 30, 2026 21:3359,50831,947,99420,821,0001,197,0002,113,536
8Jun 30, 2026 21:3359,52931,959,07220,814,0001,212,0002,113,536
9Jun 30, 2026 21:3359,54833,514,03120,825,0001,208,0002,113,536