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:37Victor MerckléVictor MerckléScore: 1,650Success
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:391,56711,998,7202,824,0001,094,0002,117,632stderr
2Jul 8, 2026 02:391,60112,073,9522,890,0001,113,0002,117,632stderr
3Jul 8, 2026 02:391,60212,026,9682,895,0001,112,0002,117,632stderr
4Jul 8, 2026 02:391,60412,035,4182,907,0001,104,0002,117,632stderr
5Jul 8, 2026 02:391,65012,199,0563,015,0001,112,0002,117,632stderr
6Jul 8, 2026 02:391,65312,201,0653,000,0001,134,0002,117,632stderr
7Jul 8, 2026 02:391,67012,218,7363,049,0001,126,0002,117,632stderr
8Jul 8, 2026 02:391,70812,870,2263,111,0001,159,0002,117,632stderr
9Jul 8, 2026 02:391,72212,377,2173,168,0001,139,0002,117,632stderr