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:08Victor MerckléVictor MerckléScore: 2,920Success
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:092,79023,991,0564,636,0002,340,0002,113,536
2May 20, 2026 14:092,84716,121,0774,642,0002,476,0002,113,536
3May 20, 2026 14:092,91715,509,4864,937,0002,357,0002,113,536
4May 20, 2026 14:092,92015,549,4004,953,0002,347,0002,113,536
5May 20, 2026 14:092,92017,622,6504,781,0002,519,0002,113,536
6May 20, 2026 14:092,92218,174,0904,961,0002,345,0002,113,536
7May 20, 2026 14:092,93215,973,0454,975,0002,355,0002,113,536
8May 20, 2026 14:092,93717,760,4754,972,0002,372,0002,113,536
9May 20, 2026 14:092,99017,140,4294,964,0002,512,0002,113,536