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 listSep 11, 2021 08:05Andrey TsvetkovAndrey TsvetkovScore: 86,097Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 08:0585,02259,424,07129,429,0002,029,0002,445,312
2Sep 11, 2021 08:0585,11657,559,59830,478,0001,015,0002,445,312
3Sep 11, 2021 08:0585,29558,127,14531,559,00002,314,240
4Sep 11, 2021 08:0585,49758,379,61430,614,0001,020,0002,437,120
5Sep 11, 2021 08:0585,56556,827,37331,659,00002,334,720
6Sep 11, 2021 08:0585,61463,069,33029,634,0002,043,0002,437,120
7Sep 11, 2021 08:0586,09759,859,80629,865,0001,991,0002,318,336
8Sep 11, 2021 08:0586,10060,975,25528,871,0002,986,0002,334,720
9Sep 11, 2021 08:0586,19263,594,28130,863,0001,028,0002,314,240
10Sep 11, 2021 08:0588,60498,214,87032,783,32102,228,224
11Sep 11, 2021 08:0588,78796,278,28332,851,09102,228,224
12Sep 11, 2021 08:0589,63599,051,50733,165,12602,220,032