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 11:06Victor MerckléVictor MerckléScore: 1,401Success
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 11:071,34812,228,8181,852,0001,520,0002,117,632stderr
2Sep 15, 2026 11:071,37412,199,0391,897,0001,538,0002,117,632stderr
3Sep 15, 2026 11:071,37812,214,0581,900,0001,545,0002,117,632stderr
4Sep 15, 2026 11:071,37912,092,0411,900,0001,549,0002,117,632stderr
5Sep 15, 2026 11:071,40112,226,2291,928,0001,576,0002,117,632stderr
6Sep 15, 2026 11:071,40212,354,0591,939,0001,566,0002,117,632stderr
7Sep 15, 2026 11:071,46512,488,8642,524,0001,140,0002,117,632stderr
8Sep 15, 2026 11:071,48312,507,7542,573,0001,136,0002,117,632stderr
9Sep 15, 2026 11:071,49712,471,9282,163,0001,580,0002,117,632stderr