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 17:46Victor 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 17:472,61215,871,5375,228,0001,303,0002,113,536
2May 29, 2026 17:472,62315,333,5865,253,0001,306,0002,113,536
3May 29, 2026 17:472,63714,470,4875,287,0001,306,0002,113,536
4May 29, 2026 17:472,67515,028,4915,349,0001,339,0002,113,536
5May 29, 2026 17:472,71314,501,3424,530,0002,254,0002,113,536
6May 29, 2026 17:472,72715,273,5565,515,0001,303,0002,113,536
7May 29, 2026 17:472,73415,407,5295,533,0001,303,0002,113,536
8May 29, 2026 17:472,75215,947,6405,578,0001,304,0002,113,536
9May 29, 2026 17:472,81415,293,6555,702,0001,334,0002,113,536