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 18:54piculpiculScore: 166,397Success
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 18:5475,42199,226,01427,905,76002,269,184
2Sep 15, 2021 18:5475,561106,149,31627,957,41602,260,992
3Sep 15, 2021 18:5476,24096,030,18228,208,62002,265,088
4Sep 15, 2021 18:54134,83571,323,72141,907,0007,982,0002,387,968
5Sep 15, 2021 18:54161,07886,908,45552,528,0007,071,0002,400,256
6Sep 15, 2021 18:54164,30890,421,38351,825,0008,969,0002,392,064
7Sep 15, 2021 18:54166,39791,311,62750,465,00011,102,0002,392,064
8Sep 15, 2021 18:54179,57890,465,32859,397,0007,047,0002,383,872
9Sep 15, 2021 18:54185,10592,368,66561,439,0007,050,0002,490,368
10Sep 15, 2021 18:54199,422106,700,23162,818,00010,968,0002,392,064
11Sep 15, 2021 18:54201,04196,840,76667,349,0007,036,0002,387,968
12Sep 15, 2021 18:54220,478112,029,04970,499,00011,078,0002,404,352