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, 2023 11:14mmalczakmmalczakScore: 99,434Success
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, 2023 11:1497,77358,796,61835,172,0001,004,0002,289,664
2Sep 16, 2023 11:1497,83563,470,56234,188,0002,011,0002,289,664
3Sep 16, 2023 11:1498,20861,918,71234,319,0002,018,0002,289,664
4Sep 16, 2023 11:1498,24959,162,40135,343,0001,009,0002,269,184
5Sep 16, 2023 11:1498,35961,949,67234,372,0002,021,0002,289,664
6Sep 16, 2023 11:1498,91666,594,50435,583,0001,016,0002,289,664
7Sep 16, 2023 11:1499,434111,437,77336,790,41502,260,992
8Sep 16, 2023 11:1499,53262,969,68334,837,0001,990,0002,289,664
9Sep 16, 2023 11:1499,64164,472,25734,875,0001,992,0002,289,664
10Sep 16, 2023 11:1499,93060,157,27234,976,0001,998,0002,289,664
11Sep 16, 2023 11:1499,974103,587,95836,990,28102,269,184
12Sep 16, 2023 11:14100,341111,136,17837,126,18902,260,992