Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listJul 17, 2023 08:45matsuoka-601matsuoka-601Score: 4,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2023 08:453,87055,919,9649,674,65902,256,896
2Jul 17, 2023 08:453,95161,997,1009,878,13102,236,416
3Jul 17, 2023 08:453,98554,298,1539,961,32702,260,992
4Jul 17, 2023 08:454,05726,346,5606,085,0004,057,0002,510,848
5Jul 17, 2023 08:454,06032,189,2948,120,0002,030,0002,510,848
6Jul 17, 2023 08:454,06534,658,9806,098,0004,065,0002,510,848
7Jul 17, 2023 08:454,07425,899,6487,130,0003,056,0002,371,584
8Jul 17, 2023 08:454,08333,410,0706,124,0004,083,0002,510,848
9Jul 17, 2023 08:454,08432,497,2766,127,0004,084,0002,383,872
10Jul 17, 2023 08:454,09726,085,6794,097,0006,146,0002,322,432
11Jul 17, 2023 08:454,11129,762,6745,139,0005,139,0002,519,040
12Jul 17, 2023 08:454,14129,623,5567,247,0003,106,0002,310,144