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:42Yuriy LyfenkoYuriy LyfenkoScore: 89,954Success
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:4288,576556,504,00330,787,0001,986,0002,326,528
2Jul 14, 2021 13:4288,868562,298,08130,889,0001,992,0002,330,624
3Jul 14, 2021 13:4289,286556,582,47831,034,0002,002,0002,326,528
4Jul 14, 2021 13:4289,300558,853,07430,038,0003,003,0002,326,528
5Jul 14, 2021 13:4289,627560,959,62131,153,0002,009,0002,506,752
6Jul 14, 2021 13:4289,739600,313,99033,203,40202,252,800
7Jul 14, 2021 13:4289,954602,463,38733,282,98702,248,704
8Jul 14, 2021 13:4290,073564,382,80532,318,0001,009,0002,326,528
9Jul 14, 2021 13:4290,251559,895,52332,382,0001,011,0002,326,528
10Jul 14, 2021 13:4290,430587,983,24033,459,06502,252,800
11Jul 14, 2021 13:4290,727564,017,75032,552,0001,017,0002,330,624
12Jul 14, 2021 13:4290,773557,038,35132,569,0001,017,0002,510,848