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 20:00mmalczakmmalczakScore: 101,424Success
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 20:0085,92487,600,38231,791,97002,256,896
2Sep 20, 2023 20:0086,43899,179,71031,982,21602,269,184
3Sep 20, 2023 20:0087,210105,248,56532,267,82202,260,992
4Sep 20, 2023 20:00100,47660,941,75435,167,0002,009,0002,355,200
5Sep 20, 2023 20:00100,80559,223,96035,282,0002,016,0002,289,664
6Sep 20, 2023 20:00100,91959,971,86035,322,0002,018,0002,289,664
7Sep 20, 2023 20:00101,42461,288,99536,513,0001,014,0002,281,472
8Sep 20, 2023 20:00101,48959,104,85336,537,0001,014,0002,527,232
9Sep 20, 2023 20:00101,95165,531,59637,722,00002,269,184
10Sep 20, 2023 20:00102,31462,841,81035,864,0001,992,0002,273,280
11Sep 20, 2023 20:00102,91161,883,82736,073,0002,004,0002,289,664
12Sep 20, 2023 20:00102,91161,138,23636,073,0002,004,0002,293,760