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 16:08Victor MerckléVictor MerckléScore: 2,687Success
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 16:102,63014,355,9645,275,0001,301,0002,113,536
2May 29, 2026 16:102,63615,215,4195,293,0001,298,0002,113,536
3May 29, 2026 16:102,66716,620,9504,437,0002,232,0002,113,536
4May 29, 2026 16:102,68715,327,8905,424,0001,295,0002,113,536
5May 29, 2026 16:102,68715,227,0935,427,0001,292,0002,113,536
6May 29, 2026 16:102,70314,834,5595,463,0001,295,0002,113,536
7May 29, 2026 16:102,70814,639,1875,472,0001,299,0002,113,536
8May 29, 2026 16:102,72717,778,7205,507,0001,312,0002,113,536
9May 29, 2026 16:102,72814,442,6095,514,0001,306,0002,113,536