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 16, 2023 10:17mmalczakmmalczakScore: 107,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 10:17106,89264,197,58339,550,00002,289,664
2Sep 16, 2023 10:17107,29773,985,16638,683,0001,017,0002,289,664
3Sep 16, 2023 10:17107,36269,573,37438,706,0001,018,0002,269,184
4Sep 16, 2023 10:17107,50871,733,40137,790,0001,988,0002,531,328
5Sep 16, 2023 10:17107,62765,428,94337,831,0001,991,0002,289,664
6Sep 16, 2023 10:17107,66570,427,80638,841,000995,0002,269,184
7Sep 16, 2023 10:17107,69564,817,01037,855,0001,992,0002,289,664
8Sep 16, 2023 10:17107,69570,418,14437,855,0001,992,0002,265,088
9Sep 16, 2023 10:17108,44167,093,35638,117,0002,006,0002,523,136
10Sep 16, 2023 10:17109,459112,655,75240,499,93402,260,992
11Sep 16, 2023 10:17109,591124,979,67740,548,83602,256,896
12Sep 16, 2023 10:17109,981114,567,99240,693,05402,269,184