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 29, 2026 23:36Victor MerckléVictor MerckléScore: 2,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 23:382,52416,177,6094,982,0001,330,0002,113,536
2May 29, 2026 23:382,52714,118,9384,992,0001,327,0002,113,536
3May 29, 2026 23:382,52916,322,8424,994,0001,330,0002,113,536
4May 29, 2026 23:382,53617,232,0905,011,0001,331,0002,113,536
5May 29, 2026 23:382,55214,114,7805,039,0001,343,0002,113,536
6May 29, 2026 23:382,56314,190,6775,080,0001,328,0002,113,536
7May 29, 2026 23:382,58814,231,6935,107,0001,363,0002,113,536
8May 29, 2026 23:382,62414,344,6345,233,0001,328,0002,113,536
9May 29, 2026 23:382,62614,496,4305,235,0001,330,0002,113,536