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 13, 2026 22:03Victor MerckléVictor MerckléScore: 8,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 22:048,18029,746,27317,348,0003,104,0002,117,632
2Jun 13, 2026 22:048,23029,819,52617,466,0003,109,0002,117,632
3Jun 13, 2026 22:048,24429,728,42817,513,0003,097,0002,117,632
4Jun 13, 2026 22:048,50930,396,70218,126,0003,147,0002,117,632
5Jun 13, 2026 22:048,60930,679,28718,406,0003,117,0002,117,632
6Jun 13, 2026 22:048,63330,722,67818,461,0003,123,0002,117,632
7Jun 13, 2026 22:048,74231,057,88418,747,0003,108,0002,117,632
8Jun 13, 2026 22:048,76531,066,75018,828,0003,086,0002,117,632
9Jun 13, 2026 22:048,79431,096,99818,836,0003,149,0002,117,632