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 14, 2026 00:17Victor MerckléVictor MerckléScore: 6,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 00:175,76023,603,83411,219,0003,183,0002,117,632
2Jun 14, 2026 00:176,03124,260,06011,882,0003,196,0002,117,632
3Jun 14, 2026 00:176,23524,793,14012,353,0003,235,0002,117,632
4Jun 14, 2026 00:176,26224,760,43012,451,0003,204,0002,117,632
5Jun 14, 2026 00:176,27024,789,43812,438,0003,239,0002,117,632
6Jun 14, 2026 00:176,29924,883,21112,533,0003,216,0002,117,632
7Jun 14, 2026 00:176,30424,934,57512,530,0003,230,0002,117,632
8Jun 14, 2026 00:176,43425,320,79812,892,0003,194,0002,117,632
9Jun 14, 2026 00:176,46425,370,14512,987,0003,174,0002,117,632