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:14Paul MasurelPaul MasurelScore: 71,586Success
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:1471,18656,798,12526,339,00002,281,472
2Jul 16, 2023 16:1471,30060,855,93726,381,00002,359,296
3Jul 16, 2023 16:1471,31447,682,20726,386,00002,465,792
4Jul 16, 2023 16:1471,40849,567,24425,405,0001,016,0002,367,488
5Jul 16, 2023 16:1471,41449,151,36325,407,0001,016,0002,355,200
6Jul 16, 2023 16:1471,48450,847,52925,432,0001,017,0002,461,696
7Jul 16, 2023 16:1471,58651,160,27625,469,0001,018,0002,281,472
8Jul 16, 2023 16:1471,64147,340,52026,507,00002,363,392
9Jul 16, 2023 16:1471,67051,922,80425,499,0001,019,0002,351,104
10Jul 16, 2023 16:1474,456101,461,93327,548,70502,195,456
11Jul 16, 2023 16:1474,46888,308,14927,553,34202,191,360
12Jul 16, 2023 16:1474,71991,836,95827,645,95602,260,992