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 14:51Victor MerckléVictor MerckléScore: 3,583Success
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 14:543,46818,095,9416,103,0002,569,0002,142,208stderr
2Jul 8, 2026 14:543,51918,138,7936,138,0002,661,0002,134,016stderr
3Jul 8, 2026 14:543,55918,734,0106,317,0002,582,0002,134,016stderr
4Jul 8, 2026 14:543,56818,282,3325,592,0003,330,0002,195,456stderr
5Jul 8, 2026 14:543,58318,337,1106,199,0002,760,0002,134,016stderr
6Jul 8, 2026 14:543,59418,442,7756,334,0002,653,0002,138,112stderr
7Jul 8, 2026 14:543,66618,601,2836,516,0002,651,0002,134,016stderr
8Jul 8, 2026 14:543,70718,643,0546,451,0002,817,0002,134,016stderr
9Jul 8, 2026 14:543,74618,696,1706,498,0002,868,0002,134,016stderr