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 10, 2026 08:15Victor MerckléVictor MerckléScore: 2,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 08:152,68815,415,6065,529,0001,193,0002,117,632stderr
2Sep 10, 2026 08:152,69515,385,9495,539,0001,200,0002,117,632stderr
3Sep 10, 2026 08:152,69515,430,8355,532,0001,206,0002,117,632stderr
4Sep 10, 2026 08:152,71315,422,8145,562,0001,221,0002,117,632stderr
5Sep 10, 2026 08:152,71815,451,1915,569,0001,226,0002,117,632stderr
6Sep 10, 2026 08:152,75115,550,0485,779,0001,099,0002,117,632stderr
7Sep 10, 2026 08:152,75815,575,3685,788,0001,109,0002,117,632stderr
8Sep 10, 2026 08:152,76815,550,0665,808,0001,113,0002,117,632stderr
9Sep 10, 2026 08:152,80215,774,9755,890,0001,115,0002,117,632stderr