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 11:53Victor MerckléVictor MerckléScore: 2,539Success
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 11:552,51515,276,5074,959,0001,329,0002,113,536
2May 30, 2026 11:552,52314,084,5884,976,0001,333,0002,113,536
3May 30, 2026 11:552,52314,095,4264,975,0001,334,0002,113,536
4May 30, 2026 11:552,53415,371,7775,000,0001,335,0002,113,536
5May 30, 2026 11:552,53915,918,3315,012,0001,337,0002,113,536
6May 30, 2026 11:552,59616,039,1754,222,0002,270,0002,113,536
7May 30, 2026 11:552,62214,338,8815,225,0001,331,0002,113,536
8May 30, 2026 11:552,63215,787,6595,227,0001,353,0002,113,536
9May 30, 2026 11:552,68514,727,8524,440,0002,274,0002,113,536