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 13, 2021 13:38Yuriy LyfenkoYuriy LyfenkoScore: 107,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 13:38106,74660,833,99038,484,0001,012,0002,334,720
2Jul 13, 2021 13:38106,86562,742,17337,513,0002,027,0002,523,136
3Jul 13, 2021 13:38106,96268,797,03937,547,0002,029,0002,383,872
4Jul 13, 2021 13:38106,96864,639,13037,549,0002,029,0002,334,720
5Jul 13, 2021 13:38107,11470,326,73637,600,0002,032,0002,326,528
6Jul 13, 2021 13:38107,68467,427,17437,851,0001,992,0002,519,040
7Jul 13, 2021 13:38107,68663,255,04038,848,000996,0002,334,720
8Jul 13, 2021 13:38107,75471,534,92437,876,0001,993,0002,514,944
9Jul 13, 2021 13:38107,84164,626,14237,906,0001,995,0002,293,760
10Jul 13, 2021 13:38109,48197,099,33840,507,79602,187,264
11Jul 13, 2021 13:38109,71792,647,14040,595,23002,179,072
12Jul 13, 2021 13:38109,904105,817,07540,664,59602,187,264