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 22:27Victor MerckléVictor MerckléScore: 2,713Success
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 22:282,68114,481,2265,399,0001,304,0002,113,536
2May 29, 2026 22:282,69715,028,8745,439,0001,304,0002,113,536
3May 29, 2026 22:282,71117,245,8295,461,0001,318,0002,113,536
4May 29, 2026 22:282,71216,245,8065,460,0001,320,0002,113,536
5May 29, 2026 22:282,71316,348,1095,465,0001,319,0002,113,536
6May 29, 2026 22:282,71714,593,3865,492,0001,302,0002,113,536
7May 29, 2026 22:282,88317,170,4475,928,0001,280,0002,113,536
8May 29, 2026 22:282,92316,440,3756,031,0001,277,0002,113,536
9May 29, 2026 22:282,98417,114,2366,189,0001,271,0002,113,536