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 listAug 17, 2026 12:24Tomislav TunkovicTomislav TunkovicScore: 59,167Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 12:2959,01330,246,80520,772,0001,063,00024,576
2Aug 17, 2026 12:2959,13730,936,61420,794,0001,087,00024,576
3Aug 17, 2026 12:2959,15130,316,45820,793,0001,093,00024,576
4Aug 17, 2026 12:2959,15930,177,29020,788,0001,101,00024,576
5Aug 17, 2026 12:2959,16730,283,56120,794,0001,098,00024,576
6Aug 17, 2026 12:2959,18130,218,15020,798,0001,099,00024,576
7Aug 17, 2026 12:2959,27831,664,40020,828,0001,105,00024,576
8Aug 17, 2026 12:2959,31630,289,24220,885,0001,062,00024,576
9Aug 17, 2026 12:2962,34540,586,47721,933,0001,135,00024,576