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:59Victor MerckléVictor MerckléScore: 2,555Success
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 21:012,53414,077,3655,011,0001,324,0002,113,536
2May 29, 2026 21:012,53417,490,2755,009,0001,326,0002,113,536
3May 29, 2026 21:012,55014,111,7215,049,0001,327,0002,113,536
4May 29, 2026 21:012,55315,389,8815,058,0001,325,0002,113,536
5May 29, 2026 21:012,55515,021,3355,059,0001,330,0002,113,536
6May 29, 2026 21:012,61215,119,4785,164,0001,366,0002,113,536
7May 29, 2026 21:012,61217,783,8595,168,0001,364,0002,113,536
8May 29, 2026 21:012,63214,300,3275,248,0001,332,0002,113,536
9May 29, 2026 21:012,67616,587,0545,337,0001,355,0002,113,536