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 listMay 30, 2026 01:38Victor MerckléVictor MerckléScore: 2,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 01:402,53114,312,3234,995,0001,333,0002,113,536
2May 30, 2026 01:402,53316,986,4125,004,0001,329,0002,113,536
3May 30, 2026 01:402,53914,127,2975,014,0001,334,0002,113,536
4May 30, 2026 01:402,54215,903,3405,028,0001,329,0002,113,536
5May 30, 2026 01:402,54415,132,6455,024,0001,336,0002,113,536
6May 30, 2026 01:402,58614,488,7545,101,0001,364,0002,113,536
7May 30, 2026 01:402,59714,271,2685,126,0001,368,0002,113,536
8May 30, 2026 01:402,62216,333,1455,230,0001,327,0002,113,536
9May 30, 2026 01:402,62414,246,0085,233,0001,327,0002,113,536