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 listMar 21, 2026 09:29Dominique GarmierDominique GarmierScore: 52,711,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 09:2951,586,271129,065,136,849128,963,679,0001,998,0002,269,184
2Mar 21, 2026 09:2952,711,956131,870,977,452131,776,891,0002,998,0002,269,184
3Mar 21, 2026 09:2952,801,122132,099,924,922131,877,874,000124,932,0002,269,184