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 1, 2026 15:38Victor MerckléVictor MerckléScore: 2,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 15:402,49213,772,1884,906,0001,324,0002,113,536
2Jun 1, 2026 15:402,49513,686,1434,912,0001,326,0002,113,536
3Jun 1, 2026 15:402,50313,732,4164,931,0001,328,0002,113,536
4Jun 1, 2026 15:402,50913,820,4144,943,0001,330,0002,113,536
5Jun 1, 2026 15:402,53313,869,3985,002,0001,332,0002,113,536
6Jun 1, 2026 15:402,57013,857,5155,085,0001,340,0002,113,536
7Jun 1, 2026 15:402,59014,067,5385,155,0001,321,0002,113,536
8Jun 1, 2026 15:402,60413,903,1205,182,0001,330,0002,113,536
9Jun 1, 2026 15:402,61213,981,5955,204,0001,327,0002,113,536