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:11Victor MerckléVictor MerckléScore: 2,870Success
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:122,74814,660,4485,508,0001,364,0002,113,536
2May 20, 2026 14:122,74814,713,5025,504,0001,368,0002,113,536
3May 20, 2026 14:122,75715,655,5045,526,0001,367,0002,113,536
4May 20, 2026 14:122,77718,833,3755,563,0001,381,0002,113,536
5May 20, 2026 14:122,87015,606,1065,812,0001,363,0002,113,536
6May 20, 2026 14:122,87516,731,8305,826,0001,362,0002,113,536
7May 20, 2026 14:122,87614,802,8445,832,0001,359,0002,113,536
8May 20, 2026 14:122,88014,930,7985,842,0001,360,0002,113,536
9May 20, 2026 14:122,91015,210,0014,954,0002,321,0002,113,536