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:07Andrey TsvetkovAndrey TsvetkovScore: 86,078Success
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:0784,82455,232,95929,361,0002,024,0002,510,848
2Jul 14, 2021 10:0784,85953,080,59730,386,0001,012,0002,367,488
3Jul 14, 2021 10:0784,97351,899,64129,412,0002,028,0002,502,656
4Jul 14, 2021 10:0785,15159,681,16129,474,0002,032,0002,334,720
5Jul 14, 2021 10:0785,15454,493,57829,475,0002,032,0002,334,720
6Jul 14, 2021 10:0785,17657,612,56030,499,0001,016,0002,334,720
7Jul 14, 2021 10:0786,07857,022,08129,859,0001,990,0002,334,720
8Jul 14, 2021 10:0786,09257,739,48829,864,0001,990,0002,502,656
9Jul 14, 2021 10:0786,13561,339,05830,875,000995,0002,334,720
10Jul 14, 2021 10:0788,14184,616,21932,612,02602,183,168
11Jul 14, 2021 10:0789,02188,573,65232,937,66102,187,264
12Jul 14, 2021 10:0789,12999,700,87332,977,67202,179,072