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 listApr 30, 2026 18:55Victor MerckléVictor MerckléScore: 14,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 18:5614,41654,045,67427,032,0009,010,0002,359,296
2Apr 30, 2026 18:5614,43055,097,12528,059,0008,016,0002,371,584
3Apr 30, 2026 18:5614,47456,101,72829,982,0006,203,0002,371,584
4Apr 30, 2026 18:5614,51351,964,91028,221,0008,063,0002,433,024
5Apr 30, 2026 18:5614,54351,024,41128,279,0008,079,0002,490,368
6Apr 30, 2026 18:5614,65358,138,14429,510,0007,123,0002,375,680
7Apr 30, 2026 18:5614,74258,626,37127,892,0008,965,0002,375,680
8Apr 30, 2026 18:5614,78456,461,21627,971,0008,990,0002,478,080
9Apr 30, 2026 18:5614,81554,009,97227,028,00010,010,0002,371,584