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 21, 2023 18:34mmalczakmmalczakScore: 84,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2023 18:3483,33254,462,18428,844,0001,989,0002,289,664
2Sep 21, 2023 18:3483,51453,782,93928,907,0001,993,0002,281,472
3Sep 21, 2023 18:3483,60558,295,66428,939,0001,995,0002,289,664
4Sep 21, 2023 18:3483,61158,626,35128,941,0001,995,0002,289,664
5Sep 21, 2023 18:3483,71453,143,65728,976,0001,998,0002,269,184
6Sep 21, 2023 18:3483,89754,070,21129,040,0002,002,0002,289,664
7Sep 21, 2023 18:3484,00057,979,30830,078,0001,002,0002,289,664
8Sep 21, 2023 18:3484,18155,752,83529,138,0002,009,0002,289,664
9Sep 21, 2023 18:3484,24658,671,60029,160,0002,011,0002,289,664
10Sep 21, 2023 18:3485,59282,545,28231,668,98702,260,992
11Sep 21, 2023 18:3485,67998,243,79331,701,37802,260,992
12Sep 21, 2023 18:3486,87698,286,20432,144,24502,277,376