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: 61,799Success
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,386178,128,354147,447,0006,018,0002,326,528
2Jul 12, 2023 22:3661,511179,733,290143,792,0009,985,0002,363,392
3Jul 12, 2023 22:3661,578180,736,933143,949,0009,996,0002,314,240
4Jul 12, 2023 22:3661,580178,274,269147,952,0005,998,0002,318,336
5Jul 12, 2023 22:3661,750179,426,923144,350,00010,024,0002,310,144
6Jul 12, 2023 22:3661,789182,392,481140,430,00014,043,0002,310,144
7Jul 12, 2023 22:3661,799180,144,850145,468,0009,029,0002,326,528
8Jul 12, 2023 22:3661,820217,412,260154,548,79202,301,952
9Jul 12, 2023 22:3661,854183,164,336147,607,0007,028,0002,310,144
10Jul 12, 2023 22:3661,901228,274,220154,752,47602,289,664
11Jul 12, 2023 22:3662,205181,277,028147,487,0008,026,0002,306,048
12Jul 12, 2023 22:3662,212218,773,454155,530,25802,301,952