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 15, 2021 18:53Igor VolkovIgor VolkovScore: 99,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2021 18:5397,71159,704,24436,153,00002,289,664
2Aug 15, 2021 18:5397,90561,127,57134,213,0002,012,0002,273,280
3Aug 15, 2021 18:5398,10558,704,62635,291,0001,008,0002,269,184
4Aug 15, 2021 18:5398,67862,648,34336,511,00002,289,664
5Aug 15, 2021 18:5398,83063,187,19136,567,00002,289,664
6Aug 15, 2021 18:5398,87358,409,25835,567,0001,016,0002,265,088
7Aug 15, 2021 18:5399,03265,759,71536,642,00002,289,664
8Aug 15, 2021 18:5399,55971,065,19636,837,00002,277,376
9Aug 15, 2021 18:53100,02261,920,97036,008,0001,000,0002,289,664
10Aug 15, 2021 18:53108,046106,901,28539,977,11602,252,800
11Aug 15, 2021 18:53108,322103,027,48640,079,18002,265,088
12Aug 15, 2021 18:53109,514100,193,93540,520,26502,260,992