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 listApr 23, 2026 09:32Charles CabergsCharles CabergsScore: 70,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 09:3370,64848,565,65324,130,0002,010,0002,371,584
2Apr 23, 2026 09:3370,77048,809,37624,171,0002,014,0002,351,104
3Apr 23, 2026 09:3370,77541,003,98524,173,0002,014,0002,306,048
4Apr 23, 2026 09:3370,84044,863,24524,195,0002,016,0002,359,296
5Apr 23, 2026 09:3370,90844,444,80424,218,0002,018,0002,363,392
6Apr 23, 2026 09:3370,95146,409,22124,233,0002,019,0002,355,200
7Apr 23, 2026 09:3370,96441,510,45524,238,0002,019,0002,306,048
8Apr 23, 2026 09:3370,98948,299,10325,256,0001,010,0002,359,296
9Apr 23, 2026 09:3371,07045,840,51025,285,0001,011,0002,367,488