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 21, 2026 21:06olliecrowolliecrowScore: 62,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 21:0762,48637,565,92020,105,0003,015,0002,519,040stderr
2Apr 21, 2026 21:0762,66444,386,87621,170,0002,016,0002,342,912stderr
3Apr 21, 2026 21:0762,67243,230,74320,165,0003,024,0002,510,848stderr
4Apr 21, 2026 21:0762,77842,276,23720,199,0003,029,0002,506,752stderr
5Apr 21, 2026 21:0762,79746,261,03920,205,0003,030,0002,498,560stderr
6Apr 21, 2026 21:0762,81843,066,29220,212,0003,031,0002,510,848stderr
7Apr 21, 2026 21:0762,85637,120,91421,235,0002,022,0002,506,752stderr
8Apr 21, 2026 21:0762,95140,459,36920,254,0003,038,0002,510,848stderr
9Apr 21, 2026 21:0765,67239,982,01021,262,0003,037,0002,347,008stderr