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 12, 2021 22:02piculpiculScore: 108,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2021 22:02103,88467,393,74537,426,0001,011,0002,506,752
2Sep 12, 2021 22:02106,29267,047,69137,312,0002,016,0002,523,136
3Sep 12, 2021 22:02106,87359,836,10238,530,0001,013,0002,281,472
4Sep 12, 2021 22:02107,71667,714,43737,863,0001,992,0002,281,472
5Sep 12, 2021 22:02107,88465,495,71237,922,0001,995,0002,514,944
6Sep 12, 2021 22:02107,90368,263,07137,928,0001,996,0002,281,472
7Sep 12, 2021 22:02108,82765,176,04838,253,0002,013,0002,281,472
8Sep 12, 2021 22:02109,51662,009,36538,495,0002,026,0002,519,040
9Sep 12, 2021 22:02113,02471,345,64240,824,000995,0002,281,472
10Sep 12, 2021 22:02118,059118,035,55743,681,73402,244,608
11Sep 12, 2021 22:02120,189117,029,88344,469,80002,256,896
12Sep 12, 2021 22:02121,837111,746,50245,079,74102,248,704