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 09:30Victor MerckléVictor MerckléScore: 1,509Success
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 09:311,45212,327,5112,031,0001,599,0002,117,632stderr
2Sep 14, 2026 09:311,47012,405,2182,531,0001,146,0002,117,632stderr
3Sep 14, 2026 09:311,48312,435,0402,119,0001,590,0002,117,632stderr
4Sep 14, 2026 09:311,49612,436,6922,132,0001,610,0002,117,632stderr
5Sep 14, 2026 09:311,50912,478,3072,488,0001,285,0002,117,632stderr
6Sep 14, 2026 09:311,51812,519,4562,625,0001,170,0002,117,632stderr
7Sep 14, 2026 09:311,55713,248,6812,708,0001,186,0002,117,632stderr
8Sep 14, 2026 09:311,56112,568,5442,719,0001,184,0002,117,632stderr
9Sep 14, 2026 09:311,56213,339,1612,712,0001,195,0002,117,632stderr