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 19, 2023 08:52mmalczakmmalczakScore: 84,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2023 08:5283,37056,724,66229,852,000995,0002,289,664
2Sep 19, 2023 08:5283,57659,228,50428,928,0001,995,0002,289,664
3Sep 19, 2023 08:5283,70553,281,82429,972,000999,0002,273,280
4Sep 19, 2023 08:5283,72454,017,16728,980,0001,998,0002,289,664
5Sep 19, 2023 08:5283,93253,822,24129,052,0002,003,0002,289,664
6Sep 19, 2023 08:5283,97356,857,78529,066,0002,004,0002,289,664
7Sep 19, 2023 08:5284,32454,057,76929,188,0002,012,0002,277,376
8Sep 19, 2023 08:5284,34654,454,77129,195,0002,013,0002,277,376
9Sep 19, 2023 08:5284,75955,444,96629,338,0002,023,0002,371,584
10Sep 19, 2023 08:5285,224102,496,31631,532,79902,273,280
11Sep 19, 2023 08:5285,70788,762,64131,711,74902,265,088
12Sep 19, 2023 08:5286,98290,842,57532,183,24402,265,088