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 12:02Victor MerckléVictor MerckléScore: 2,595Success
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 12:032,56814,164,2805,102,0001,320,0002,113,536
2May 29, 2026 12:032,56916,283,9025,103,0001,320,0002,113,536
3May 29, 2026 12:032,57614,764,0825,118,0001,324,0002,113,536
4May 29, 2026 12:032,59215,179,3705,153,0001,327,0002,113,536
5May 29, 2026 12:032,59514,248,3535,155,0001,333,0002,113,536
6May 29, 2026 12:032,61514,425,0065,220,0001,319,0002,113,536
7May 29, 2026 12:032,63916,186,9815,241,0001,358,0002,113,536
8May 29, 2026 12:032,70415,292,3985,445,0001,317,0002,113,536
9May 29, 2026 12:032,74714,637,8534,608,0002,261,0002,113,536