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 listMay 30, 2026 04:49Victor MerckléVictor MerckléScore: 2,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 04:512,52813,913,0004,991,0001,330,0002,113,536
2May 30, 2026 04:512,52814,094,5694,986,0001,335,0002,113,536
3May 30, 2026 04:512,53815,224,1005,009,0001,336,0002,113,536
4May 30, 2026 04:512,53814,327,4255,012,0001,335,0002,113,536
5May 30, 2026 04:512,58715,969,2145,115,0001,354,0002,113,536
6May 30, 2026 04:512,58714,496,6855,134,0001,334,0002,113,536
7May 30, 2026 04:512,58914,571,3185,106,0001,368,0002,113,536
8May 30, 2026 04:512,62314,369,7715,192,0001,367,0002,113,536
9May 30, 2026 04:512,62916,524,0535,235,0001,338,0002,113,536