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 listSep 22, 2023 21:45mmalczakmmalczakScore: 73,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2023 21:4572,93251,055,59725,986,000999,0002,269,184
2Sep 22, 2023 21:4572,98954,528,11425,006,0002,000,0002,289,664
3Sep 22, 2023 21:4573,03858,110,51025,023,0002,001,0002,289,664
4Sep 22, 2023 21:4573,07048,559,63725,034,0002,002,0002,273,280
5Sep 22, 2023 21:4573,10548,506,85526,048,0001,001,0002,277,376
6Sep 22, 2023 21:4573,19251,498,64925,075,0002,006,0002,289,664
7Sep 22, 2023 21:4573,21450,119,15625,083,0002,006,0002,281,472
8Sep 22, 2023 21:4573,26552,357,88725,100,0002,008,0002,289,664
9Sep 22, 2023 21:4573,41948,489,36625,153,0002,012,0002,289,664
10Sep 22, 2023 21:4575,84591,864,41328,062,49802,256,896
11Sep 22, 2023 21:4575,908101,818,27228,086,01702,260,992
12Sep 22, 2023 21:4576,04293,852,81328,135,66902,265,088