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 12, 2021 21:59piculpiculScore: 125,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2021 21:59123,86574,403,83743,838,0001,992,0002,441,216
2Sep 12, 2021 21:59124,58669,836,38644,093,0002,004,0002,461,696
3Sep 12, 2021 21:59124,72769,806,43845,146,0001,003,0002,469,888
4Sep 12, 2021 21:59125,033110,043,33146,262,35602,191,360
5Sep 12, 2021 21:59125,12771,331,97244,285,0002,012,0002,461,696
6Sep 12, 2021 21:59125,13068,052,09845,292,0001,006,0002,457,600
7Sep 12, 2021 21:59125,469107,307,92146,423,42402,297,856
8Sep 12, 2021 21:59125,972112,617,70346,609,68802,293,760
9Sep 12, 2021 21:59126,67673,254,75645,873,000997,0002,465,792
10Sep 12, 2021 21:59127,23268,800,74645,073,0002,003,0002,441,216
11Sep 12, 2021 21:59127,23568,359,54746,076,0001,001,0002,465,792
12Sep 12, 2021 21:59128,82777,504,29645,638,0002,028,0002,441,216