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 18, 2026 21:54Charles CabergsCharles CabergsScore: 75,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 21:5475,25157,018,12525,855,0001,988,0002,371,584
2Apr 18, 2026 21:5475,26858,020,77124,866,0002,983,0002,371,584
3Apr 18, 2026 21:5475,28155,307,89025,865,0001,989,0002,383,872
4Apr 18, 2026 21:5475,29253,043,49925,869,0001,989,0002,510,848
5Apr 18, 2026 21:5475,37854,640,41925,898,0001,992,0002,375,680
6Apr 18, 2026 21:5475,43555,912,46624,921,0002,990,0002,519,040
7Apr 18, 2026 21:5475,46851,812,24424,932,0002,991,0002,519,040
8Apr 18, 2026 21:5475,50555,256,84226,940,000997,0002,379,776
9Apr 18, 2026 21:5475,57053,842,24925,964,0001,997,0002,510,848