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 14:02Yuriy LyfenkoYuriy LyfenkoScore: 87,622Success
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 14:0286,670559,898,30230,064,0002,004,0002,330,624
2Jul 14, 2021 14:0286,673559,923,96429,063,0003,006,0002,326,528
3Jul 14, 2021 14:0286,692553,905,91530,072,0002,004,0002,502,656
4Jul 14, 2021 14:0286,992555,213,82729,170,0003,017,0002,326,528
5Jul 14, 2021 14:0287,095560,312,46829,204,0003,021,0002,326,528
6Jul 14, 2021 14:0287,368555,650,02530,306,0002,020,0002,330,624
7Jul 14, 2021 14:0287,622552,425,36130,394,0002,026,0002,510,848
8Jul 14, 2021 14:0287,959599,486,04232,544,74602,252,800
9Jul 14, 2021 14:0288,300588,890,68732,671,01302,248,704
10Jul 14, 2021 14:0288,595561,472,23429,800,0002,980,0002,510,848
11Jul 14, 2021 14:0288,638558,966,65330,809,0001,987,0002,326,528
12Jul 14, 2021 14:0289,020594,465,19732,937,55802,301,952