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 30, 2026 10:58Charles CabergsCharles CabergsScore: 72,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 10:5972,45646,025,05323,831,0002,978,0002,351,104
2Apr 30, 2026 10:5972,48146,994,73624,832,0001,986,0002,359,296
3Apr 30, 2026 10:5972,51344,551,62323,849,0002,981,0002,363,392
4Apr 30, 2026 10:5972,57245,403,44624,863,0001,989,0002,363,392
5Apr 30, 2026 10:5972,62942,791,83324,883,0001,990,0002,306,048
6Apr 30, 2026 10:5972,70840,756,35624,910,0001,992,0002,293,760
7Apr 30, 2026 10:5972,73743,336,39524,920,0001,993,0002,306,048
8Apr 30, 2026 10:5972,73744,779,83325,878,0001,035,0002,363,392
9Apr 30, 2026 10:5972,92746,204,18024,985,0001,998,0002,359,296