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:23piculpiculScore: 72,614Success
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:2372,20055,468,55825,687,0001,027,0002,289,664
2Sep 15, 2021 19:2372,54957,535,97424,855,0001,988,0002,277,376
3Sep 15, 2021 19:2372,55459,793,29624,857,0001,988,0002,289,664
4Sep 15, 2021 19:2372,55958,032,75824,859,0001,988,0002,289,664
5Sep 15, 2021 19:2372,57656,192,81624,864,0001,989,0002,277,376
6Sep 15, 2021 19:2372,58451,590,60624,867,0001,989,0002,273,280
7Sep 15, 2021 19:2372,61453,665,35424,877,0001,990,0002,289,664
8Sep 15, 2021 19:2372,62253,204,21724,880,0001,990,0002,289,664
9Sep 15, 2021 19:2372,62754,409,73924,882,0001,990,0002,531,328
10Sep 15, 2021 19:2375,31581,735,81527,866,61202,273,280
11Sep 15, 2021 19:2375,527103,120,29327,945,00502,273,280
12Sep 15, 2021 19:2375,78690,048,40528,040,97702,265,088