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 listSep 15, 2026 03:45Victor MerckléVictor MerckléScore: 1,464Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 03:461,38712,227,0071,891,0001,577,0002,117,632stderr
2Sep 15, 2026 03:461,42512,245,2751,969,0001,594,0002,117,632stderr
3Sep 15, 2026 03:461,43912,423,1362,052,0001,546,0002,117,632stderr
4Sep 15, 2026 03:461,45212,428,8332,090,0001,541,0002,117,632stderr
5Sep 15, 2026 03:461,46412,491,1532,083,0001,578,0002,117,632stderr
6Sep 15, 2026 03:461,46512,282,2222,511,0001,152,0002,117,632stderr
7Sep 15, 2026 03:461,47012,477,8212,096,0001,581,0002,117,632stderr
8Sep 15, 2026 03:461,49312,488,8982,609,0001,125,0002,117,632stderr
9Sep 15, 2026 03:461,50413,188,9252,166,0001,596,0002,117,632stderr