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 listJun 30, 2026 17:52Victor MerckléVictor MerckléScore: 1,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 17:551,75612,275,2023,162,0001,230,0002,117,632stderr
2Jun 30, 2026 17:551,79712,381,2293,227,0001,267,0002,117,632stderr
3Jun 30, 2026 17:551,82112,452,0523,139,0001,415,0002,117,632stderr
4Jun 30, 2026 17:551,83112,539,9903,320,0001,258,0002,117,632stderr
5Jun 30, 2026 17:551,83412,556,6703,201,0001,385,0002,117,632stderr
6Jun 30, 2026 17:551,84912,567,9573,403,0001,221,0002,117,632stderr
7Jun 30, 2026 17:551,87212,972,5153,446,0001,236,0002,117,632stderr
8Jun 30, 2026 17:551,89012,669,7013,468,0001,258,0002,117,632stderr
9Jun 30, 2026 17:551,92112,982,5533,439,0001,365,0002,117,632stderr