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 4, 2024 14:25Andrey LikhachevAndrey LikhachevScore: 70,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2024 14:2569,91450,899,10124,874,000994,0002,371,584
2Aug 4, 2024 14:2569,97056,883,01124,894,000995,0002,289,664
3Aug 4, 2024 14:2569,99753,424,96823,907,0001,992,0002,375,680
4Aug 4, 2024 14:2570,03556,009,48023,920,0001,993,0002,375,680
5Aug 4, 2024 14:2570,28955,011,90525,007,0001,000,0002,367,488
6Aug 4, 2024 14:2570,64152,360,36424,127,0002,010,0002,371,584
7Aug 4, 2024 14:2570,65948,760,84424,133,0002,011,0002,371,584
8Aug 4, 2024 14:2570,73553,214,72424,159,0002,013,0002,363,392
9Aug 4, 2024 14:2570,76549,845,93924,169,0002,014,0002,289,664
10Aug 4, 2024 14:2573,35094,281,54127,139,53202,199,552
11Aug 4, 2024 14:2573,527100,693,92127,205,13702,347,008
12Aug 4, 2024 14:2573,90092,382,10627,343,15302,215,936