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 19:42piculpiculScore: 73,605Success
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 19:4273,05149,899,51025,027,0002,002,0002,535,424
2Sep 15, 2021 19:4273,10855,349,66425,047,0002,003,0002,293,760
3Sep 15, 2021 19:4273,14654,751,77625,060,0002,004,0002,293,760
4Sep 15, 2021 19:4273,38654,522,37226,148,0001,005,0002,281,472
5Sep 15, 2021 19:4273,39749,868,50625,146,0002,011,0002,293,760
6Sep 15, 2021 19:4273,40550,853,43625,149,0002,011,0002,293,760
7Sep 15, 2021 19:4273,60550,329,19926,226,0001,008,0002,269,184
8Sep 15, 2021 19:4273,60849,607,90125,218,0002,017,0002,277,376
9Sep 15, 2021 19:4273,81957,865,79126,302,0001,011,0002,273,280
10Sep 15, 2021 19:4275,81498,759,23828,051,23102,256,896
11Sep 15, 2021 19:4276,088100,258,42328,152,54402,265,088
12Sep 15, 2021 19:4276,228133,519,17028,204,50902,260,992