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:03Andrey TsvetkovAndrey TsvetkovScore: 86,181Success
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:0385,03054,252,52430,447,0001,014,0002,424,832
2Sep 11, 2021 08:0385,13552,380,00231,500,00002,334,720
3Sep 11, 2021 08:0385,26856,983,36129,514,0002,035,0002,420,736
4Sep 11, 2021 08:0385,30553,634,82031,563,00002,424,832
5Sep 11, 2021 08:0385,51459,269,40330,620,0001,020,0002,334,720
6Sep 11, 2021 08:0386,10858,035,28930,865,000995,0002,437,120
7Sep 11, 2021 08:0386,18157,344,44030,891,000996,0002,433,024
8Sep 11, 2021 08:0386,18663,157,70030,893,000996,0002,433,024
9Sep 11, 2021 08:0386,28660,472,21329,931,0001,995,0002,334,720
10Sep 11, 2021 08:0389,03399,031,87832,942,29302,224,128
11Sep 11, 2021 08:0389,03697,639,25732,943,32402,224,128
12Sep 11, 2021 08:0389,76775,672,91533,213,67302,224,128