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 29, 2026 20:47Victor MerckléVictor MerckléScore: 2,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 20:492,57517,297,9845,125,0001,314,0002,113,536
2May 29, 2026 20:492,58517,323,6555,144,0001,319,0002,113,536
3May 29, 2026 20:492,63415,517,6205,238,0001,349,0002,113,536
4May 29, 2026 20:492,63916,478,0065,248,0001,351,0002,113,536
5May 29, 2026 20:492,64015,462,8715,245,0001,355,0002,113,536
6May 29, 2026 20:492,66817,016,4065,360,0001,311,0002,113,536
7May 29, 2026 20:492,68316,789,2205,396,0001,312,0002,113,536
8May 29, 2026 20:492,68714,450,8935,409,0001,309,0002,113,536
9May 29, 2026 20:492,70315,551,7165,453,0001,305,0002,113,536