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 16, 2021 10:54Mikhail ShirokovMikhail ShirokovScore: 106,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2021 10:54105,23864,772,62336,942,0001,996,0002,519,040
2Sep 16, 2021 10:54105,31663,260,82137,968,000999,0002,519,040
3Sep 16, 2021 10:54105,44961,594,87239,016,00002,519,040
4Sep 16, 2021 10:54105,53064,279,38238,045,0001,001,0002,387,968
5Sep 16, 2021 10:54105,64166,059,57138,085,0001,002,0002,502,656
6Sep 16, 2021 10:54105,77366,624,00336,126,0003,010,0002,383,872
7Sep 16, 2021 10:54106,47361,003,74339,395,00002,506,752
8Sep 16, 2021 10:54106,88467,452,09037,519,0002,028,0002,387,968
9Sep 16, 2021 10:54106,93864,538,67239,567,00002,379,776
10Sep 16, 2021 10:54108,639106,098,14840,196,35002,248,704
11Sep 16, 2021 10:54109,428106,389,83940,488,26302,199,552
12Sep 16, 2021 10:54109,901111,758,82940,663,39002,252,800