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:00Yuriy LyfenkoYuriy LyfenkoScore: 87,268Success
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:0086,338555,642,33729,949,0001,996,0002,330,624
2Jul 14, 2021 14:0086,827556,339,60930,119,0002,007,0002,326,528
3Jul 14, 2021 14:0086,896595,157,24132,151,49202,252,800
4Jul 14, 2021 14:0086,941554,382,59629,153,0003,015,0002,519,040
5Jul 14, 2021 14:0086,965554,120,63229,161,0003,016,0002,510,848
6Jul 14, 2021 14:0087,170556,366,01230,238,0002,015,0002,502,656
7Jul 14, 2021 14:0087,268561,061,96729,262,0003,027,0002,326,528
8Jul 14, 2021 14:0087,661597,983,62132,434,74802,179,072
9Jul 14, 2021 14:0087,735553,547,70230,434,0002,028,0002,326,528
10Jul 14, 2021 14:0087,819552,299,96831,478,0001,015,0002,375,680
11Jul 14, 2021 14:0088,071601,456,73732,586,22902,252,800
12Jul 14, 2021 14:0088,516554,686,78531,759,000992,0002,514,944