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 listJul 16, 2023 16:20Paul MasurelPaul MasurelScore: 73,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 16:2072,55957,567,03825,853,000994,0002,359,296
2Jul 16, 2023 16:2072,56556,473,52725,855,000994,0002,351,104
3Jul 16, 2023 16:2072,66856,971,04824,896,0001,991,0002,359,296
4Jul 16, 2023 16:2072,78455,304,54924,936,0001,994,0002,281,472
5Jul 16, 2023 16:2072,91652,800,87925,980,000999,0002,285,568
6Jul 16, 2023 16:2072,97652,583,29425,001,0002,000,0002,285,568
7Jul 16, 2023 16:2073,06252,806,29325,031,0002,002,0002,445,312
8Jul 16, 2023 16:2073,13552,953,63126,058,0001,002,0002,281,472
9Jul 16, 2023 16:2073,17051,878,06625,068,0002,005,0002,359,296
10Jul 16, 2023 16:2073,301107,465,71427,121,42502,195,456
11Jul 16, 2023 16:2073,494101,649,35027,192,67502,314,240
12Jul 16, 2023 16:2073,819116,948,49927,313,08402,191,360