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 listJul 7, 2026 21:21Victor MerckléVictor MerckléScore: 1,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 21:241,62112,125,1862,885,0001,169,0002,117,632stderr
2Jul 7, 2026 21:241,65412,224,7442,933,0001,204,0002,117,632stderr
3Jul 7, 2026 21:241,65712,244,8182,935,0001,209,0002,117,632stderr
4Jul 7, 2026 21:241,65812,212,4592,946,0001,201,0002,117,632stderr
5Jul 7, 2026 21:241,65812,209,6222,954,0001,193,0002,117,632stderr
6Jul 7, 2026 21:241,66412,222,7352,949,0001,211,0002,117,632stderr
7Jul 7, 2026 21:241,67512,238,1102,989,0001,200,0002,117,632stderr
8Jul 7, 2026 21:241,69112,330,0833,014,0001,215,0002,117,632stderr
9Jul 7, 2026 21:241,73812,432,5743,127,0001,219,0002,117,632stderr