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 20, 2026 14:49Victor MerckléVictor MerckléScore: 2,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 14:512,72117,420,7055,447,0001,356,0002,113,536
2May 20, 2026 14:512,72816,210,7545,462,0001,359,0002,113,536
3May 20, 2026 14:512,73114,614,9745,472,0001,356,0002,113,536
4May 20, 2026 14:512,73815,074,0785,490,0001,357,0002,113,536
5May 20, 2026 14:512,77214,723,7975,573,0001,358,0002,113,536
6May 20, 2026 14:512,83617,411,4975,726,0001,366,0002,113,536
7May 20, 2026 14:512,84716,211,0125,772,0001,346,0002,113,536
8May 20, 2026 14:512,90516,955,5154,937,0002,326,0002,113,536
9May 20, 2026 14:512,90715,703,9214,938,0002,330,0002,113,536