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 20, 2026 14:56Victor MerckléVictor MerckléScore: 2,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 14:572,68616,378,2805,380,0001,337,0002,113,536
2May 20, 2026 14:572,70516,393,5715,417,0001,347,0002,113,536
3May 20, 2026 14:572,76015,812,1865,570,0001,332,0002,113,536
4May 20, 2026 14:572,76614,978,2514,624,0002,292,0002,113,536
5May 20, 2026 14:572,80614,802,9085,683,0001,332,0002,113,536
6May 20, 2026 14:572,80817,130,5895,686,0001,334,0002,113,536
7May 20, 2026 14:572,81916,997,7325,707,0001,342,0002,113,536
8May 20, 2026 14:572,83017,026,5735,736,0001,339,0002,113,536
9May 20, 2026 14:572,87416,954,0594,880,0002,306,0002,113,536