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 5, 2026 00:28Victor MerckléVictor MerckléScore: 1,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 00:321,44711,884,4982,545,0001,074,0002,117,632stderr
2Sep 5, 2026 00:321,45612,079,0422,559,0001,083,0002,117,632stderr
3Sep 5, 2026 00:321,53112,219,6322,726,0001,102,0002,117,632stderr
4Sep 5, 2026 00:321,54712,288,7242,743,0001,125,0002,117,632stderr
5Sep 5, 2026 00:321,55012,348,2262,739,0001,137,0002,117,632stderr
6Sep 5, 2026 00:321,56012,361,4042,771,0001,130,0002,117,632stderr
7Sep 5, 2026 00:321,56112,203,3082,762,0001,142,0002,117,632stderr
8Sep 5, 2026 00:321,56812,150,4882,759,0001,163,0002,117,632stderr
9Sep 5, 2026 00:321,63612,531,7892,953,0001,137,0002,117,632stderr