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:06Andrey TsvetkovAndrey TsvetkovScore: 88,849Success
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:0687,68952,390,75631,432,0001,013,0002,293,760
2Sep 11, 2021 08:0687,78957,133,89831,467,0001,015,0002,289,664
3Sep 11, 2021 08:0687,80354,379,71831,472,0001,015,0002,301,952
4Sep 11, 2021 08:0688,01956,153,22230,532,0002,035,0002,334,720
5Sep 11, 2021 08:0688,04963,817,83730,542,0002,036,0002,326,528
6Sep 11, 2021 08:0688,38467,812,31730,659,0002,043,0002,334,720
7Sep 11, 2021 08:0688,84957,912,60930,820,0002,054,0002,334,720
8Sep 11, 2021 08:0688,85158,421,80430,883,0001,992,0002,334,720
9Sep 11, 2021 08:0688,87865,721,72830,892,0001,993,0002,334,720
10Sep 11, 2021 08:0691,16493,897,66533,730,49902,232,320
11Sep 11, 2021 08:0691,224113,735,40733,752,77902,228,224
12Sep 11, 2021 08:0691,866108,669,25033,990,45502,228,224