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 12, 2023 22:31Yuriy LyfenkoYuriy LyfenkoScore: 61,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 22:3161,753183,476,351149,370,0005,012,0002,494,464
2Jul 12, 2023 22:3161,818185,492,547145,514,0009,031,0002,461,696
3Jul 12, 2023 22:3161,823233,408,219154,557,83502,293,760
4Jul 12, 2023 22:3161,897179,213,819142,762,00011,980,0002,363,392
5Jul 12, 2023 22:3161,937185,763,993143,854,00010,988,0002,449,408
6Jul 12, 2023 22:3161,939232,800,489154,847,69402,293,760
7Jul 12, 2023 22:3161,944183,726,426143,870,00010,990,0002,306,048
8Jul 12, 2023 22:3162,023184,866,664145,055,00010,003,0002,318,336
9Jul 12, 2023 22:3162,100180,700,288145,235,00010,016,0002,314,240
10Jul 12, 2023 22:3162,168237,625,960155,420,31202,301,952
11Jul 12, 2023 22:3162,168186,969,879149,403,0006,016,0002,428,928
12Jul 12, 2023 22:3163,304189,724,074145,239,00013,021,0002,306,048