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 20, 2023 19:55mmalczakmmalczakScore: 84,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2023 19:5583,50056,497,38028,902,0001,993,0002,289,664
2Sep 20, 2023 19:5583,63854,899,08829,948,000998,0002,289,664
3Sep 20, 2023 19:5583,64652,970,16728,953,0001,996,0002,281,472
4Sep 20, 2023 19:5583,75158,095,45828,989,0001,999,0002,277,376
5Sep 20, 2023 19:5583,98153,489,18429,069,0002,004,0002,289,664
6Sep 20, 2023 19:5584,01451,322,61229,080,0002,005,0002,289,664
7Sep 20, 2023 19:5584,25757,882,06529,164,0002,011,0002,523,136
8Sep 20, 2023 19:5585,37657,828,81630,570,0001,019,0002,281,472
9Sep 20, 2023 19:5585,44658,677,20430,596,0001,019,0002,281,472
10Sep 20, 2023 19:5586,03697,258,08431,833,42402,256,896
11Sep 20, 2023 19:5586,74690,421,71832,095,87802,265,088
12Sep 20, 2023 19:5587,203106,562,31932,265,10202,260,992