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 19:41Victor MerckléVictor MerckléScore: 1,651Success
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 19:431,63411,992,6972,927,0001,158,0002,117,632stderr
2Jun 30, 2026 19:431,64812,035,3042,954,0001,167,0002,117,632stderr
3Jun 30, 2026 19:431,64812,015,4222,942,0001,180,0002,117,632stderr
4Jun 30, 2026 19:431,64912,088,3142,950,0001,173,0002,117,632stderr
5Jun 30, 2026 19:431,65112,011,8782,961,0001,168,0002,117,632stderr
6Jun 30, 2026 19:431,71412,174,2053,082,0001,205,0002,117,632stderr
7Jun 30, 2026 19:431,74412,310,1813,158,0001,202,0002,117,632stderr
8Jun 30, 2026 19:431,77212,761,3383,197,0001,233,0002,117,632stderr
9Jun 30, 2026 19:431,78012,732,0063,202,0001,250,0002,117,632stderr