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:14Yuriy LyfenkoYuriy LyfenkoScore: 86,189Success
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:1485,141557,625,74930,486,0001,016,0002,326,528
2Jul 14, 2021 14:1485,297557,780,03329,524,0002,036,0002,519,040
3Jul 14, 2021 14:1485,868561,919,33629,786,0001,985,0002,326,528
4Jul 14, 2021 14:1486,084558,615,33029,861,0001,990,0002,330,624
5Jul 14, 2021 14:1486,157559,385,56229,886,0001,992,0002,519,040
6Jul 14, 2021 14:1486,170556,671,64528,894,0002,989,0002,326,528
7Jul 14, 2021 14:1486,189557,109,39628,901,0002,989,0002,330,624
8Jul 14, 2021 14:1486,249561,353,68428,921,0002,991,0002,326,528
9Jul 14, 2021 14:1486,741557,572,63331,092,0001,002,0002,510,848
10Jul 14, 2021 14:1487,384604,552,11832,331,93202,248,704
11Jul 14, 2021 14:1487,624605,580,14032,421,02102,248,704
12Jul 14, 2021 14:1487,757583,090,71932,470,10202,248,704