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 15, 2026 13:19Victor MerckléVictor MerckléScore: 1,833Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 13:281,71911,743,3053,084,0001,215,0002,117,632
2Jun 15, 2026 13:281,72511,656,3353,101,0001,213,0002,117,632
3Jun 15, 2026 13:281,82411,883,0083,346,0001,214,0002,117,632
4Jun 15, 2026 13:281,83011,930,7253,347,0001,229,0002,117,632
5Jun 15, 2026 13:281,83311,957,4293,368,0001,215,0002,117,632
6Jun 15, 2026 13:281,86412,020,2163,447,0001,215,0002,117,632
7Jun 15, 2026 13:281,92412,199,9703,389,0001,423,0002,117,632
8Jun 15, 2026 13:281,93212,036,5743,418,0001,414,0002,117,632
9Jun 15, 2026 13:281,93512,228,7383,410,0001,428,0002,117,632