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 03:02Victor MerckléVictor MerckléScore: 2,532Success
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 03:042,52114,631,5044,972,0001,331,0002,113,536
2May 30, 2026 03:042,52514,234,4434,983,0001,331,0002,113,536
3May 30, 2026 03:042,52815,841,5184,989,0001,333,0002,113,536
4May 30, 2026 03:042,53216,255,1144,996,0001,334,0002,113,536
5May 30, 2026 03:042,53214,186,5054,995,0001,337,0002,113,536
6May 30, 2026 03:042,53815,452,1535,009,0001,336,0002,113,536
7May 30, 2026 03:042,56214,828,5335,054,0001,353,0002,113,536
8May 30, 2026 03:042,59715,821,0715,125,0001,369,0002,113,536
9May 30, 2026 03:042,65615,759,9315,289,0001,352,0002,113,536