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 18:19Yuriy LyfenkoYuriy LyfenkoScore: 64,430Success
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 18:1964,257555,814,14421,794,0001,981,0002,281,472
2Jul 13, 2021 18:1964,281555,077,24821,802,0001,982,0002,281,472
3Jul 13, 2021 18:1964,292552,948,54222,797,000991,0002,285,568
4Jul 13, 2021 18:1964,300553,430,75921,809,0001,982,0002,285,568
5Jul 13, 2021 18:1964,303549,551,61022,801,000991,0002,285,568
6Jul 13, 2021 18:1964,370548,645,54121,833,0001,984,0002,285,568
7Jul 13, 2021 18:1964,430546,810,83021,853,0001,986,0002,285,568
8Jul 13, 2021 18:1964,557547,283,94121,896,0001,990,0002,281,472
9Jul 13, 2021 18:1964,578547,758,41721,903,0001,991,0002,281,472
10Jul 13, 2021 18:1966,960586,885,08324,775,13602,260,992
11Jul 13, 2021 18:1967,091582,390,80024,823,81302,252,800
12Jul 13, 2021 18:1967,335586,914,13824,913,95302,248,704