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 15:54Victor MerckléVictor MerckléScore: 2,682Success
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 15:562,57114,979,1875,109,0001,320,0002,113,536
2May 29, 2026 15:562,57414,245,0805,115,0001,321,0002,113,536
3May 29, 2026 15:562,59914,289,3455,162,0001,336,0002,113,536
4May 29, 2026 15:562,60115,766,2935,166,0001,338,0002,113,536
5May 29, 2026 15:562,68215,446,9825,390,0001,317,0002,113,536
6May 29, 2026 15:562,69517,772,1045,422,0001,317,0002,113,536
7May 29, 2026 15:562,70117,042,7265,427,0001,327,0002,113,536
8May 29, 2026 15:562,70421,256,5295,444,0001,316,0002,113,536
9May 29, 2026 15:562,70714,693,9145,420,0001,349,0002,113,536