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 15:53Mikhail ShirokovMikhail ShirokovScore: 108,408Success
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 15:53107,12466,578,98539,636,00002,379,776
2Sep 15, 2021 15:53107,26265,801,93839,687,00002,260,992
3Sep 15, 2021 15:53107,64969,706,82538,835,000995,0002,519,040
4Sep 15, 2021 15:53107,71164,644,33638,857,000996,0002,519,040
5Sep 15, 2021 15:53107,75768,326,73337,877,0001,993,0002,387,968
6Sep 15, 2021 15:53107,77067,585,75637,882,0001,993,0002,387,968
7Sep 15, 2021 15:53108,40865,259,16138,106,0002,005,0002,519,040
8Sep 15, 2021 15:53108,98162,344,54339,315,0001,008,0002,519,040
9Sep 15, 2021 15:53109,28163,015,59939,424,0001,010,0002,392,064
10Sep 15, 2021 15:53110,79099,061,76140,992,28202,252,800
11Sep 15, 2021 15:53111,400104,051,59241,218,07302,318,336
12Sep 15, 2021 15:53112,603115,149,32441,662,97302,244,608