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 08:17Victor MerckléVictor MerckléScore: 1,513Success
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 08:181,43612,459,0172,022,0001,570,0002,117,632stderr
2Sep 15, 2026 08:181,48412,513,9712,180,0001,531,0002,117,632stderr
3Sep 15, 2026 08:181,49112,523,3652,173,0001,555,0002,117,632stderr
4Sep 15, 2026 08:181,50212,462,5562,197,0001,560,0002,117,632stderr
5Sep 15, 2026 08:181,51313,241,2032,631,0001,152,0002,117,632stderr
6Sep 15, 2026 08:181,52412,529,2032,253,0001,558,0002,117,632stderr
7Sep 15, 2026 08:181,53312,518,4272,256,0001,578,0002,117,632stderr
8Sep 15, 2026 08:181,53812,539,3582,669,0001,176,0002,117,632stderr
9Sep 15, 2026 08:181,53912,500,1512,257,0001,592,0002,117,632stderr