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 10:21Victor MerckléVictor MerckléScore: 1,403Success
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 10:221,34712,195,3511,819,0001,550,0002,117,632stderr
2Sep 15, 2026 10:221,38713,795,7941,877,0001,592,0002,117,632stderr
3Sep 15, 2026 10:221,38812,204,5531,877,0001,594,0002,117,632stderr
4Sep 15, 2026 10:221,39512,197,1371,886,0001,603,0002,117,632stderr
5Sep 15, 2026 10:221,40312,119,9871,897,0001,611,0002,117,632stderr
6Sep 15, 2026 10:221,44712,440,5402,460,0001,158,0002,117,632stderr
7Sep 15, 2026 10:221,46412,444,1022,464,0001,198,0002,117,632stderr
8Sep 15, 2026 10:221,47613,121,3862,090,0001,602,0002,117,632stderr
9Sep 15, 2026 10:221,51612,642,0342,148,0001,643,0002,117,632stderr