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 17:58IlyaIlyaScore: 59,300Success
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 17:5958,85131,291,26620,669,0001,106,0002,113,536
2Jun 30, 2026 17:5958,98931,328,14820,717,0001,109,0002,113,536
3Jun 30, 2026 17:5959,17831,504,76020,688,0001,208,0002,113,536
4Jun 30, 2026 17:5959,19431,415,26020,763,0001,139,0002,113,536
5Jun 30, 2026 17:5959,30031,423,32020,779,0001,162,0002,113,536
6Jun 30, 2026 17:5959,36431,897,46420,762,0001,203,0002,113,536
7Jun 30, 2026 17:5959,94339,633,78021,036,0001,143,0002,113,536
8Jun 30, 2026 17:5960,45141,305,48721,126,0001,241,0002,117,632
9Jun 30, 2026 17:5967,96444,308,84424,019,0001,128,0002,113,536