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:08Victor MerckléVictor MerckléScore: 1,684Success
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:091,61512,742,7442,113,0001,925,0002,117,632stderr
2Sep 15, 2026 03:091,62412,762,0172,125,0001,936,0002,117,632stderr
3Sep 15, 2026 03:091,62912,653,9672,119,0001,955,0002,117,632stderr
4Sep 15, 2026 03:091,63212,716,4832,140,0001,942,0002,117,632stderr
5Sep 15, 2026 03:091,68412,966,6722,065,0002,145,0002,117,632stderr
6Sep 15, 2026 03:091,73013,091,5482,418,0001,909,0002,117,632stderr
7Sep 15, 2026 03:091,77413,144,2072,550,0001,885,0002,117,632stderr
8Sep 15, 2026 03:091,80213,034,7462,599,0001,908,0002,117,632stderr
9Sep 15, 2026 03:091,80413,155,1792,615,0001,895,0002,117,632stderr