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 3, 2021 14:36Ilya AniskovetsIlya AniskovetsScore: 126,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2021 14:36125,34674,280,38245,370,0001,008,0002,289,664
2Sep 3, 2021 14:36125,69776,415,02045,497,0001,011,0002,527,232
3Sep 3, 2021 14:36125,97370,703,18145,597,0001,013,0002,289,664
4Sep 3, 2021 14:36126,07373,120,64045,633,0001,014,0002,289,664
5Sep 3, 2021 14:36126,11472,483,52946,662,00002,289,664
6Sep 3, 2021 14:36126,14179,038,76045,658,0001,014,0002,265,088
7Sep 3, 2021 14:36126,54971,188,89344,831,0001,992,0002,289,664
8Sep 3, 2021 14:36126,58672,964,68446,837,00002,273,280
9Sep 3, 2021 14:36126,60575,978,71645,848,000996,0002,289,664
10Sep 3, 2021 14:36128,290104,071,08247,467,12002,269,184
11Sep 3, 2021 14:36128,625112,168,11947,591,33302,256,896
12Sep 3, 2021 14:36128,810111,476,83847,659,79602,265,088