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 listJun 2, 2026 02:51Victor MerckléVictor MerckléScore: 2,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 02:522,24013,224,2574,364,0001,238,0002,113,536
2Jun 2, 2026 02:522,24714,855,6304,382,0001,237,0002,113,536
3Jun 2, 2026 02:522,25913,322,4614,397,0001,251,0002,113,536
4Jun 2, 2026 02:522,29520,568,8174,478,0001,260,0002,113,536
5Jun 2, 2026 02:522,33113,464,8684,581,0001,247,0002,113,536
6Jun 2, 2026 02:522,33113,831,8924,586,0001,243,0002,113,536
7Jun 2, 2026 02:522,34313,859,1794,608,0001,251,0002,113,536
8Jun 2, 2026 02:522,35216,351,2204,635,0001,246,0002,113,536
9Jun 2, 2026 02:522,35313,513,3564,623,0001,260,0002,113,536