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:16Victor MerckléVictor MerckléScore: 2,782Success
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:172,71015,966,9905,429,0001,346,0002,113,536
2May 20, 2026 14:172,71714,565,5305,444,0001,349,0002,113,536
3May 20, 2026 14:172,72117,256,8955,453,0001,350,0002,113,536
4May 20, 2026 14:172,77815,683,2425,565,0001,381,0002,113,536
5May 20, 2026 14:172,78215,739,5875,612,0001,345,0002,113,536
6May 20, 2026 14:172,84014,911,7985,758,0001,344,0002,113,536
7May 20, 2026 14:172,84114,866,1175,756,0001,348,0002,113,536
8May 20, 2026 14:172,84215,904,3075,757,0001,348,0002,113,536
9May 20, 2026 14:172,86317,040,1445,802,0001,356,0002,113,536