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 13:39Yuriy LyfenkoYuriy LyfenkoScore: 88,668Success
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 13:3987,049559,126,14130,195,0002,013,0002,326,528
2Jul 14, 2021 13:3987,535554,892,81431,376,0001,012,0002,506,752
3Jul 14, 2021 13:3987,592556,170,21130,384,0002,025,0002,514,944
4Jul 14, 2021 13:3988,000562,087,05031,543,0001,017,0002,326,528
5Jul 14, 2021 13:3988,549561,197,22830,778,0001,985,0002,326,528
6Jul 14, 2021 13:3988,554567,424,03629,787,0002,978,0002,514,944
7Jul 14, 2021 13:3988,668558,472,20730,819,0001,988,0002,330,624
8Jul 14, 2021 13:3988,846592,721,93832,873,11402,248,704
9Jul 14, 2021 13:3989,073590,471,10032,957,18902,252,800
10Jul 14, 2021 13:3989,289560,887,75430,034,0003,003,0002,330,624
11Jul 14, 2021 13:3989,426592,951,81633,087,79302,183,168
12Jul 14, 2021 13:3990,292560,744,36631,384,0002,024,0002,318,336