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:05Paul MasurelPaul MasurelScore: 70,781Success
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:0570,51654,114,29224,084,0002,007,0002,355,200
2Jul 16, 2023 16:0570,59552,214,84424,111,0002,009,0002,281,472
3Jul 16, 2023 16:0570,67848,158,75324,140,0002,011,0002,355,200
4Jul 16, 2023 16:0570,68649,102,50724,143,0002,011,0002,351,104
5Jul 16, 2023 16:0570,73549,637,99925,166,0001,006,0002,355,200
6Jul 16, 2023 16:0570,74948,811,26624,164,0002,013,0002,281,472
7Jul 16, 2023 16:0570,78152,893,73024,175,0002,014,0002,359,296
8Jul 16, 2023 16:0570,85149,101,09824,199,0002,016,0002,281,472
9Jul 16, 2023 16:0571,02747,763,90925,270,0001,010,0002,285,568
10Jul 16, 2023 16:0573,52394,719,83327,203,49602,256,896
11Jul 16, 2023 16:0573,613101,837,16827,236,77702,195,456
12Jul 16, 2023 16:0574,03299,037,44827,392,02302,195,456