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:36Yuriy LyfenkoYuriy LyfenkoScore: 62,157Success
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:3661,914181,492,653142,801,00011,983,0002,453,504
2Jul 12, 2023 22:3661,920185,883,398143,814,00010,985,0002,355,200
3Jul 12, 2023 22:3661,980184,878,317146,954,0007,997,0002,318,336
4Jul 12, 2023 22:3662,004184,719,342142,009,00013,000,0002,338,816
5Jul 12, 2023 22:3662,012183,499,097144,028,00011,002,0002,400,256
6Jul 12, 2023 22:3662,023178,664,036146,055,0009,003,0002,326,528
7Jul 12, 2023 22:3662,157181,240,430144,366,00011,027,0002,404,352
8Jul 12, 2023 22:3662,169183,754,534146,398,0009,024,0002,318,336
9Jul 12, 2023 22:3662,238182,652,221147,565,0008,030,0002,306,048
10Jul 12, 2023 22:3662,279217,069,345155,697,31002,293,760
11Jul 12, 2023 22:3662,287235,620,757155,717,43002,301,952
12Jul 12, 2023 22:3662,400223,200,708156,000,87602,301,952