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 listJul 14, 2021 10:06Andrey TsvetkovAndrey TsvetkovScore: 86,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 10:0684,60550,440,93728,275,0003,029,0002,326,528
2Jul 14, 2021 10:0684,89755,461,26729,386,0002,026,0002,506,752
3Jul 14, 2021 10:0685,01654,127,91428,412,0003,044,0002,510,848
4Jul 14, 2021 10:0685,19554,825,42830,506,0001,016,0002,510,848
5Jul 14, 2021 10:0685,29754,690,46129,524,0002,036,0002,506,752
6Jul 14, 2021 10:0685,31453,547,32229,530,0002,036,0002,334,720
7Jul 14, 2021 10:0686,10064,553,13330,862,000995,0002,494,464
8Jul 14, 2021 10:0686,10063,218,75328,871,0002,986,0002,334,720
9Jul 14, 2021 10:0686,11463,777,70629,871,0001,991,0002,318,336
10Jul 14, 2021 10:0688,11397,387,60132,601,74702,301,952
11Jul 14, 2021 10:0688,82694,473,81032,865,61802,297,856
12Jul 14, 2021 10:0689,09094,150,00032,963,26502,301,952