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 10:55Andrey TsvetkovAndrey TsvetkovScore: 120,303Success
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 10:55119,98473,724,38642,377,0002,017,0002,531,328
2Jul 13, 2021 10:55119,98968,367,33943,387,0001,009,0002,531,328
3Jul 13, 2021 10:55120,06868,555,53742,406,0002,019,0002,535,424
4Jul 13, 2021 10:55120,10069,886,07642,418,0002,019,0002,330,624
5Jul 13, 2021 10:55120,21665,338,90642,459,0002,021,0002,334,720
6Jul 13, 2021 10:55120,25167,380,61243,482,0001,011,0002,527,232
7Jul 13, 2021 10:55120,30368,258,95943,501,0001,011,0002,531,328
8Jul 13, 2021 10:55120,31468,129,15243,505,0001,011,0002,531,328
9Jul 13, 2021 10:55120,33866,711,05543,514,0001,011,0002,334,720
10Jul 13, 2021 10:55122,860112,805,57645,458,12702,203,648
11Jul 13, 2021 10:55123,000102,185,29445,509,84002,207,744
12Jul 13, 2021 10:55123,212108,042,24945,588,48602,199,552