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 8, 2026 12:06Victor MerckléVictor MerckléScore: 1,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 12:071,74712,040,8183,016,0001,353,0002,113,536
2Jun 8, 2026 12:071,74812,048,2283,009,0001,363,0002,113,536
3Jun 8, 2026 12:071,74912,037,8253,019,0001,355,0002,113,536
4Jun 8, 2026 12:071,75612,005,3483,022,0001,368,0002,113,536
5Jun 8, 2026 12:071,75612,155,8403,177,0001,214,0002,113,536
6Jun 8, 2026 12:071,75612,082,4403,019,0001,373,0002,113,536
7Jun 8, 2026 12:071,76012,139,2083,036,0001,365,0002,113,536
8Jun 8, 2026 12:071,87212,688,1983,466,0001,215,0002,113,536
9Jun 8, 2026 12:071,96812,934,9383,474,0001,446,0002,113,536