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 19, 2026 09:31Charles CabergsCharles CabergsScore: 70,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 09:3170,33551,900,07025,024,0001,000,0002,375,680
2Apr 19, 2026 09:3170,35151,865,31224,028,0002,002,0002,375,680
3Apr 19, 2026 09:3170,47352,775,24824,070,0002,005,0002,523,136
4Apr 19, 2026 09:3170,55153,454,42924,096,0002,008,0002,375,680
5Apr 19, 2026 09:3170,61653,620,44024,119,0002,009,0002,265,088
6Apr 19, 2026 09:3170,79251,810,05225,186,0001,007,0002,523,136
7Apr 19, 2026 09:3170,85752,100,77325,209,0001,008,0002,375,680
8Apr 19, 2026 09:3170,94654,319,28724,231,0002,019,0002,523,136
9Apr 19, 2026 09:3171,30354,506,39224,353,0002,029,0002,367,488