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 20:26Victor MerckléVictor MerckléScore: 1,635Success
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 20:281,61212,053,6582,879,0001,151,0002,117,632stderr
2Jul 7, 2026 20:281,61612,075,8212,881,0001,161,0002,117,632stderr
3Jul 7, 2026 20:281,62212,071,1282,889,0001,167,0002,117,632stderr
4Jul 7, 2026 20:281,63112,095,1172,908,0001,171,0002,117,632stderr
5Jul 7, 2026 20:281,63512,095,1642,911,0001,177,0002,117,632stderr
6Jul 7, 2026 20:281,63612,115,4132,910,0001,180,0002,117,632stderr
7Jul 7, 2026 20:281,63812,086,1832,913,0001,182,0002,117,632stderr
8Jul 7, 2026 20:281,70412,263,7443,009,0001,253,0002,117,632stderr
9Jul 7, 2026 20:281,70912,334,5443,054,0001,219,0002,117,632stderr