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:07Yuriy LyfenkoYuriy LyfenkoScore: 87,373Success
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:0786,178558,204,84629,894,0001,992,0002,326,528
2Jul 14, 2021 14:0786,303556,600,54029,937,0001,995,0002,326,528
3Jul 14, 2021 14:0786,662561,126,50730,061,0002,004,0002,326,528
4Jul 14, 2021 14:0786,862555,872,39630,131,0002,008,0002,326,528
5Jul 14, 2021 14:0787,016552,295,00230,184,0002,012,0002,326,528
6Jul 14, 2021 14:0787,062551,346,28930,200,0002,013,0002,330,624
7Jul 14, 2021 14:0787,373593,270,72232,327,89602,179,072
8Jul 14, 2021 14:0787,530555,849,73931,374,0001,012,0002,326,528
9Jul 14, 2021 14:0787,535559,971,56731,376,0001,012,0002,519,040
10Jul 14, 2021 14:0787,546553,682,62430,368,0002,024,0002,326,528
11Jul 14, 2021 14:0787,728599,755,25332,459,33302,183,168
12Jul 14, 2021 14:0788,549592,285,16632,763,31102,252,800