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 14, 2026 22:54Victor 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 14, 2026 23:091,37012,137,7561,858,0001,569,0002,117,632stderr
2Sep 14, 2026 23:091,37711,929,1951,862,0001,582,0002,117,632stderr
3Sep 14, 2026 23:091,42712,251,0071,963,0001,605,0002,117,632stderr
4Sep 14, 2026 23:091,45612,389,2132,010,0001,630,0002,117,632stderr
5Sep 14, 2026 23:091,46413,042,2492,087,0001,573,0002,117,632stderr
6Sep 14, 2026 23:091,46412,435,4512,074,0001,586,0002,117,632stderr
7Sep 14, 2026 23:091,46812,297,1452,513,0001,159,0002,117,632stderr
8Sep 14, 2026 23:091,47312,346,0482,111,0001,573,0002,117,632stderr
9Sep 14, 2026 23:091,48713,627,5972,116,0001,602,0002,117,632stderr