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 15, 2021 15:27Mikhail ShirokovMikhail ShirokovScore: 109,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 15:27107,98468,543,26137,957,0001,997,0002,375,680
2Sep 15, 2021 15:27108,19768,973,79338,032,0002,001,0002,519,040
3Sep 15, 2021 15:27108,42469,383,48238,112,0002,005,0002,523,136
4Sep 15, 2021 15:27108,69766,829,45439,213,0001,005,0002,396,160
5Sep 15, 2021 15:27108,97665,480,74939,313,0001,008,0002,519,040
6Sep 15, 2021 15:27109,20562,387,02939,396,0001,010,0002,387,968
7Sep 15, 2021 15:27109,47863,257,95639,495,0001,012,0002,519,040
8Sep 15, 2021 15:27109,66265,028,54139,561,0001,014,0002,473,984
9Sep 15, 2021 15:27109,70074,055,05638,560,0002,029,0002,519,040
10Sep 15, 2021 15:27112,302105,913,73741,551,85702,252,800
11Sep 15, 2021 15:27112,415102,418,33541,593,41802,248,704
12Sep 15, 2021 15:27112,748113,023,73841,716,73902,252,800