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 12:09Victor MerckléVictor MerckléScore: 2,628Success
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 12:112,56914,248,6705,117,0001,307,0002,113,536
2May 29, 2026 12:112,57614,180,8565,133,0001,309,0002,113,536
3May 29, 2026 12:112,58616,059,3765,155,0001,312,0002,113,536
4May 29, 2026 12:112,60214,251,0185,181,0001,326,0002,113,536
5May 29, 2026 12:112,62815,901,3645,238,0001,334,0002,113,536
6May 29, 2026 12:112,68215,278,4275,392,0001,315,0002,113,536
7May 29, 2026 12:112,68416,220,3425,409,0001,301,0002,113,536
8May 29, 2026 12:112,70115,378,9885,443,0001,310,0002,113,536
9May 29, 2026 12:112,74214,786,2585,532,0001,325,0002,113,536