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:57mmalczakmmalczakScore: 74,568Success
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:5773,68950,781,61125,246,0002,019,0002,527,232
2Sep 22, 2023 21:5773,69252,572,99525,247,0002,019,0002,289,664
3Sep 22, 2023 21:5773,99548,371,03325,350,0002,028,0002,281,472
4Sep 22, 2023 21:5774,45749,396,85626,529,0001,020,0002,289,664
5Sep 22, 2023 21:5774,45958,361,72427,550,00002,289,664
6Sep 22, 2023 21:5774,55156,486,73726,563,0001,021,0002,289,664
7Sep 22, 2023 21:5774,56855,373,93026,569,0001,021,0002,375,680
8Sep 22, 2023 21:5774,78456,846,60626,646,0001,024,0002,289,664
9Sep 22, 2023 21:5775,30852,150,11926,869,000995,0002,375,680
10Sep 22, 2023 21:5776,18288,231,17328,187,51902,273,280
11Sep 22, 2023 21:5776,53097,254,40328,316,02402,273,280
12Sep 22, 2023 21:5776,557100,990,79028,325,97702,252,800