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 30, 2026 10:48Victor MerckléVictor MerckléScore: 2,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 10:502,76415,687,4105,578,0001,334,0002,113,536
2May 30, 2026 10:502,77615,623,1875,604,0001,338,0002,113,536
3May 30, 2026 10:502,78014,786,3035,612,0001,339,0002,113,536
4May 30, 2026 10:502,78515,925,3535,622,0001,341,0002,113,536
5May 30, 2026 10:502,79617,434,3745,641,0001,351,0002,113,536
6May 30, 2026 10:502,83215,497,0525,676,0001,405,0002,113,536
7May 30, 2026 10:502,83517,829,6085,749,0001,339,0002,113,536
8May 30, 2026 10:502,86315,802,2825,818,0001,341,0002,113,536
9May 30, 2026 10:502,86615,289,0834,862,0002,304,0002,113,536