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 9, 2023 23:21gchebanovgchebanovScore: 13,999Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2023 23:2113,74760,661,95027,292,0007,075,0002,433,024
2Jul 9, 2023 23:2113,84464,467,65126,466,0008,143,0002,449,408
3Jul 9, 2023 23:2113,84764,570,32626,472,0008,145,0002,486,272
4Jul 9, 2023 23:2113,93260,487,86026,869,0007,961,0002,437,120
5Jul 9, 2023 23:2113,95159,677,46626,906,0007,972,0002,490,368
6Jul 9, 2023 23:2113,95660,189,78828,909,0005,981,0002,383,872
7Jul 9, 2023 23:2113,99962,871,91124,999,0009,999,0002,379,776
8Jul 9, 2023 23:2114,00656,678,43330,012,0005,002,0002,383,872
9Jul 9, 2023 23:2114,11360,145,14026,210,0009,072,0002,383,872
10Jul 9, 2023 23:2114,40895,793,76436,021,08402,228,224
11Jul 9, 2023 23:2114,449107,651,99336,123,67602,224,128
12Jul 9, 2023 23:2114,502105,650,29636,253,95302,232,320