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 listNov 27, 2024 15:48Joad NacerJoad NacerScore: 34,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2024 15:4834,142113,558,53782,343,0003,012,0002,510,848
2Nov 27, 2024 15:4834,199115,687,95584,493,0001,005,0002,461,696
3Nov 27, 2024 15:4834,201118,628,26283,492,0002,011,0002,502,656
4Nov 27, 2024 15:4834,222111,132,31684,550,0001,006,0002,363,392
5Nov 27, 2024 15:4834,228110,793,99683,557,0002,013,0002,273,280
6Nov 27, 2024 15:4834,276117,515,50482,665,0003,024,0002,338,816
7Nov 27, 2024 15:4834,303113,857,99882,767,0002,991,0002,281,472
8Nov 27, 2024 15:4834,338117,377,25283,850,0001,996,0002,465,792
9Nov 27, 2024 15:4834,346118,002,59683,868,0001,996,0002,306,048