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 16:57piculpiculScore: 143,373Success
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 16:57130,437109,286,24248,261,77902,252,800
2Sep 15, 2021 16:57134,921118,037,03349,920,63202,248,704
3Sep 15, 2021 16:57135,409109,092,55650,101,35002,260,992
4Sep 15, 2021 16:57142,20581,058,83851,605,0001,011,0002,514,944
5Sep 15, 2021 16:57142,55980,907,38351,733,0001,014,0002,519,040
6Sep 15, 2021 16:57142,90377,841,42550,879,0001,995,0002,293,760
7Sep 15, 2021 16:57143,37379,672,81151,047,0002,001,0002,523,136
8Sep 15, 2021 16:57144,76879,559,47153,564,00002,523,136
9Sep 15, 2021 16:57145,04180,708,54752,653,0001,012,0002,523,136
10Sep 15, 2021 16:57145,52777,062,43951,851,0001,994,0002,527,232
11Sep 15, 2021 16:57145,58979,892,41751,873,0001,995,0002,519,040
12Sep 15, 2021 16:57145,62277,718,41653,880,00002,379,776