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 23:01Victor MerckléVictor MerckléScore: 1,588Success
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 23:031,54812,108,2692,803,0001,069,0002,117,632stderr
2Jul 7, 2026 23:031,58612,038,2662,880,0001,087,0002,117,632stderr
3Jul 7, 2026 23:031,58611,995,2332,870,0001,095,0002,117,632stderr
4Jul 7, 2026 23:031,58611,952,5822,872,0001,095,0002,117,632stderr
5Jul 7, 2026 23:031,58812,069,7222,875,0001,095,0002,117,632stderr
6Jul 7, 2026 23:031,59412,089,3432,882,0001,104,0002,117,632stderr
7Jul 7, 2026 23:031,59512,143,6382,878,0001,111,0002,117,632stderr
8Jul 7, 2026 23:031,60112,051,7702,898,0001,105,0002,117,632stderr
9Jul 7, 2026 23:031,60412,042,0992,887,0001,124,0002,117,632stderr