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 listAug 31, 2026 12:03Victor MerckléVictor MerckléScore: 56,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 12:0456,27529,604,92519,802,0001,020,0002,117,632stderr
2Aug 31, 2026 12:0456,30529,929,51519,803,0001,030,0002,117,632stderr
3Aug 31, 2026 12:0456,32929,084,15019,800,0001,042,0002,117,632stderr
4Aug 31, 2026 12:0456,36229,874,79219,826,0001,028,0002,117,632stderr
5Aug 31, 2026 12:0456,40029,150,72019,831,0001,037,0002,117,632stderr
6Aug 31, 2026 12:0456,46229,992,39419,836,0001,055,0002,117,632stderr
7Aug 31, 2026 12:0456,53529,220,43719,869,0001,049,0002,117,632stderr
8Aug 31, 2026 12:0456,54029,182,86219,876,0001,044,0002,117,632stderr
9Aug 31, 2026 12:0456,62729,974,06319,866,0001,086,0002,117,632stderr