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:25Victor MerckléVictor MerckléScore: 2,601Success
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:262,53214,155,0444,994,0001,336,0002,113,536
2May 30, 2026 04:262,53714,091,3985,007,0001,336,0002,113,536
3May 30, 2026 04:262,54613,949,8845,025,0001,342,0002,113,536
4May 30, 2026 04:262,57114,400,3955,073,0001,355,0002,113,536
5May 30, 2026 04:262,60114,717,4635,129,0001,374,0002,113,536
6May 30, 2026 04:262,60514,991,0885,140,0001,374,0002,113,536
7May 30, 2026 04:262,62114,350,3695,216,0001,337,0002,113,536
8May 30, 2026 04:262,62714,352,0525,236,0001,332,0002,113,536
9May 30, 2026 04:262,65616,297,8035,299,0001,343,0002,113,536