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 07:04Victor MerckléVictor MerckléScore: 2,626Success
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 07:062,52615,972,4254,979,0001,336,0002,113,536
2May 30, 2026 07:062,52614,269,4914,981,0001,335,0002,113,536
3May 30, 2026 07:062,53214,045,4164,997,0001,335,0002,113,536
4May 30, 2026 07:062,61415,270,1595,205,0001,331,0002,113,536
5May 30, 2026 07:062,62616,494,7495,235,0001,331,0002,113,536
6May 30, 2026 07:062,62814,709,0285,233,0001,338,0002,113,536
7May 30, 2026 07:062,65714,428,7025,293,0001,350,0002,113,536
8May 30, 2026 07:062,68114,925,0944,422,0002,282,0002,113,536
9May 30, 2026 07:062,69014,444,2984,434,0002,292,0002,113,536