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 9, 2026 20:50Victor MerckléVictor MerckléScore: 64,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 20:5163,79132,602,19822,542,0001,061,0002,113,536
2Jun 9, 2026 20:5163,90832,647,48122,589,0001,057,0002,113,536
3Jun 9, 2026 20:5164,08332,731,57322,559,0001,152,0002,113,536
4Jun 9, 2026 20:5164,10232,716,30222,557,0001,161,0002,113,536
5Jun 9, 2026 20:5164,21832,808,82122,610,0001,151,0002,113,536
6Jun 9, 2026 20:5164,22432,735,00122,612,0001,151,0002,113,536
7Jun 9, 2026 20:5164,58932,842,94122,744,0001,154,0002,113,536
8Jun 9, 2026 20:5164,60832,965,62222,750,0001,155,0002,113,536
9Jun 9, 2026 20:5164,68933,334,62922,923,0001,012,0002,113,536