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:17Paul MasurelPaul MasurelScore: 72,830Success
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:1772,55958,711,70426,847,00002,285,568
2Jul 16, 2023 16:1772,61456,703,39625,872,000995,0002,363,392
3Jul 16, 2023 16:1772,68952,801,09824,903,0001,992,0002,363,392
4Jul 16, 2023 16:1772,72458,233,27725,912,000996,0002,351,104
5Jul 16, 2023 16:1772,75952,210,97924,927,0001,994,0002,285,568
6Jul 16, 2023 16:1772,81955,785,10124,948,0001,995,0002,355,200
7Jul 16, 2023 16:1772,83061,409,87825,949,000998,0002,359,296
8Jul 16, 2023 16:1773,13851,124,60125,057,0002,004,0002,355,200
9Jul 16, 2023 16:1773,19252,059,42826,078,0001,003,0002,351,104
10Jul 16, 2023 16:1774,08898,842,93227,412,70902,195,456
11Jul 16, 2023 16:1774,597102,706,42727,600,80302,195,456
12Jul 16, 2023 16:1774,865100,627,17527,699,96802,195,456