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 8, 2026 02:27Victor MerckléVictor MerckléScore: 1,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 02:281,58512,071,4562,840,0001,124,0002,117,632stderr
2Jul 8, 2026 02:281,59612,022,2202,873,0001,118,0002,117,632stderr
3Jul 8, 2026 02:281,59713,369,5042,866,0001,127,0002,117,632stderr
4Jul 8, 2026 02:281,59812,030,8812,870,0001,127,0002,117,632stderr
5Jul 8, 2026 02:281,60111,980,1712,706,0001,298,0002,117,632stderr
6Jul 8, 2026 02:281,60312,016,7892,881,0001,128,0002,117,632stderr
7Jul 8, 2026 02:281,62012,093,5202,887,0001,165,0002,117,632stderr
8Jul 8, 2026 02:281,71112,750,9643,095,0001,183,0002,117,632stderr
9Jul 8, 2026 02:281,71512,399,7663,105,0001,183,0002,117,632stderr