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 listMay 24, 2024 18:59CemaCemaScore: 85,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2024 18:5984,18958,031,21429,141,0002,009,0002,510,848
2May 24, 2024 18:5984,24659,135,48829,160,0002,011,0002,514,944
3May 24, 2024 18:5984,30855,179,01429,182,0002,012,0002,293,760
4May 24, 2024 18:5984,66253,585,05329,304,0002,021,0002,510,848
5May 24, 2024 18:5985,29756,234,57430,542,0001,018,0002,293,760
6May 24, 2024 18:5985,50360,359,25530,616,0001,020,0002,293,760
7May 24, 2024 18:5985,62755,700,66430,660,0001,022,0002,510,848
8May 24, 2024 18:5986,33556,535,81029,948,0001,996,0002,293,760
9May 24, 2024 18:5986,45759,936,36329,990,0001,999,0002,293,760
10May 24, 2024 18:5987,57197,337,82732,401,16602,236,416
11May 24, 2024 18:5987,901101,377,23232,523,29702,240,512
12May 24, 2024 18:5989,00696,401,52132,932,04502,228,224