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 29, 2026 10:37Victor MerckléVictor MerckléScore: 2,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 10:392,61614,460,9625,201,0001,340,0002,113,536
2May 29, 2026 10:392,62914,355,5795,228,0001,346,0002,113,536
3May 29, 2026 10:392,63415,228,2815,246,0001,340,0002,113,536
4May 29, 2026 10:392,64014,424,6595,253,0001,347,0002,113,536
5May 29, 2026 10:392,73416,484,9655,497,0001,339,0002,113,536
6May 29, 2026 10:392,73615,782,8875,499,0001,343,0002,113,536
7May 29, 2026 10:392,75116,894,7034,572,0002,306,0002,113,536
8May 29, 2026 10:392,78914,700,9204,669,0002,304,0002,113,536
9May 29, 2026 10:392,80415,669,1714,709,0002,302,0002,113,536