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 listAug 7, 2022 10:37Franek KortaFranek KortaScore: 77,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2022 10:3776,32459,097,31625,215,0003,025,0002,326,528
2Aug 7, 2022 10:3776,80550,236,20926,389,0002,029,0002,330,624
3Aug 7, 2022 10:3776,86252,926,58925,392,0003,047,0002,318,336
4Aug 7, 2022 10:3777,05451,110,89427,492,0001,018,0002,351,104
5Aug 7, 2022 10:3777,08149,653,93325,465,0003,055,0002,355,200
6Aug 7, 2022 10:3777,13051,291,61327,519,0001,019,0002,322,432
7Aug 7, 2022 10:3777,14655,513,64427,525,0001,019,0002,318,336
8Aug 7, 2022 10:3777,37653,255,43426,655,0001,974,0002,347,008
9Aug 7, 2022 10:3778,46553,521,24225,028,0004,004,0002,408,448
10Aug 7, 2022 10:3781,281102,617,77630,074,13302,293,760
11Aug 7, 2022 10:3781,82797,488,03130,275,88702,293,760
12Aug 7, 2022 10:3781,90897,561,62130,305,89502,301,952