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 17:31Victor MerckléVictor MerckléScore: 2,701Success
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 17:332,58116,136,3385,147,0001,306,0002,113,536
2May 29, 2026 17:332,59414,329,6115,177,0001,309,0002,113,536
3May 29, 2026 17:332,60216,520,1115,191,0001,314,0002,113,536
4May 29, 2026 17:332,67714,495,4105,343,0001,351,0002,113,536
5May 29, 2026 17:332,70115,161,9135,444,0001,310,0002,113,536
6May 29, 2026 17:332,70215,830,1125,451,0001,306,0002,113,536
7May 29, 2026 17:332,72615,066,8965,496,0001,320,0002,113,536
8May 29, 2026 17:332,72815,665,8465,514,0001,306,0002,113,536
9May 29, 2026 17:332,77415,953,7345,600,0001,335,0002,113,536