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 02:12Victor MerckléVictor MerckléScore: 2,561Success
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 02:142,53515,823,5695,005,0001,334,0002,113,536
2May 30, 2026 02:142,53613,960,1835,009,0001,332,0002,113,536
3May 30, 2026 02:142,54214,424,2515,023,0001,333,0002,113,536
4May 30, 2026 02:142,55716,162,2935,047,0001,347,0002,113,536
5May 30, 2026 02:142,56115,028,4765,058,0001,345,0002,113,536
6May 30, 2026 02:142,60614,241,2385,195,0001,322,0002,113,536
7May 30, 2026 02:142,62414,167,7355,234,0001,326,0002,113,536
8May 30, 2026 02:142,63314,563,7655,252,0001,332,0002,113,536
9May 30, 2026 02:142,64715,497,4195,267,0001,352,0002,113,536