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 05:50Victor MerckléVictor MerckléScore: 2,567Success
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 05:522,52314,638,1294,980,0001,328,0002,113,536
2May 30, 2026 05:522,53716,186,0555,014,0001,329,0002,113,536
3May 30, 2026 05:522,53815,857,7765,011,0001,335,0002,113,536
4May 30, 2026 05:522,54217,526,7925,022,0001,334,0002,113,536
5May 30, 2026 05:522,56717,525,4245,070,0001,349,0002,113,536
6May 30, 2026 05:522,57115,715,5815,097,0001,332,0002,113,536
7May 30, 2026 05:522,61115,835,4565,203,0001,326,0002,113,536
8May 30, 2026 05:522,62614,606,3345,235,0001,330,0002,113,536
9May 30, 2026 05:522,65815,768,7945,278,0001,367,0002,113,536