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 20, 2026 13:00Victor MerckléVictor MerckléScore: 2,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 13:012,71315,471,7395,650,0001,134,0002,113,536
2May 20, 2026 13:012,72216,674,4465,670,0001,136,0002,113,536
3May 20, 2026 13:012,72916,572,0765,683,0001,141,0002,113,536
4May 20, 2026 13:012,73217,291,5835,691,0001,140,0002,113,536
5May 20, 2026 13:012,76816,088,8545,778,0001,142,0002,113,536
6May 20, 2026 13:012,79017,503,4395,834,0001,141,0002,113,536
7May 20, 2026 13:012,83416,190,1335,068,0002,018,0002,113,536
8May 20, 2026 13:012,84615,622,0395,976,0001,140,0002,113,536
9May 20, 2026 13:012,92115,702,8235,286,0002,018,0002,113,536