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 listJun 30, 2026 22:58Victor MerckléVictor MerckléScore: 1,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 22:591,63311,988,7542,906,0001,178,0002,117,632stderr
2Jun 30, 2026 22:591,64112,014,0922,926,0001,177,0002,117,632stderr
3Jun 30, 2026 22:591,64111,995,7182,930,0001,173,0002,117,632stderr
4Jun 30, 2026 22:591,64112,021,8412,923,0001,180,0002,117,632stderr
5Jun 30, 2026 22:591,65012,096,7212,941,0001,185,0002,117,632stderr
6Jun 30, 2026 22:591,65012,033,9802,941,0001,184,0002,117,632stderr
7Jun 30, 2026 22:591,68912,131,6993,008,0001,215,0002,117,632stderr
8Jun 30, 2026 22:591,74312,257,0053,157,0001,202,0002,117,632stderr
9Jun 30, 2026 22:591,75912,310,0363,186,0001,213,0002,117,632stderr