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 22:20Victor MerckléVictor MerckléScore: 1,624Success
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 22:221,60012,048,8512,920,0001,082,0002,117,632stderr
2Jul 7, 2026 22:221,60312,059,2492,926,0001,082,0002,117,632stderr
3Jul 7, 2026 22:221,60412,200,8742,917,0001,094,0002,117,632stderr
4Jul 7, 2026 22:221,60512,182,4102,925,0001,088,0002,117,632stderr
5Jul 7, 2026 22:221,62412,244,3272,936,0001,124,0002,117,632stderr
6Jul 7, 2026 22:221,62811,988,3722,953,0001,118,0002,117,632stderr
7Jul 7, 2026 22:221,64212,147,8302,998,0001,107,0002,117,632stderr
8Jul 7, 2026 22:221,67712,272,0583,061,0001,132,0002,117,632stderr
9Jul 7, 2026 22:221,68712,732,0673,103,0001,116,0002,117,632stderr