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 16, 2023 16:42mmalczakmmalczakScore: 98,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 16:4297,29263,449,61733,999,0001,999,0002,289,664
2Sep 16, 2023 16:4297,37664,767,60934,028,0002,001,0002,289,664
3Sep 16, 2023 16:4297,93060,200,69534,221,0002,013,0002,273,280
4Sep 16, 2023 16:4297,96559,906,94834,234,0002,013,0002,273,280
5Sep 16, 2023 16:4298,00861,501,73434,249,0002,014,0002,289,664
6Sep 16, 2023 16:4298,45463,320,42535,417,0001,011,0002,289,664
7Sep 16, 2023 16:4298,81460,799,83635,546,0001,015,0002,265,088
8Sep 16, 2023 16:4299,08962,787,21736,663,00002,289,664
9Sep 16, 2023 16:4299,63861,597,62734,874,0001,992,0002,289,664
10Sep 16, 2023 16:42100,48495,684,45437,179,02602,256,896
11Sep 16, 2023 16:42100,728105,337,78137,269,24602,285,568
12Sep 16, 2023 16:42100,76098,648,52037,281,10102,273,280