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 17:59Victor MerckléVictor MerckléScore: 1,690Success
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 18:011,63812,055,8472,921,0001,175,0002,117,632stderr
2Jun 30, 2026 18:011,64412,043,8722,940,0001,172,0002,117,632stderr
3Jun 30, 2026 18:011,64912,039,6012,944,0001,180,0002,117,632stderr
4Jun 30, 2026 18:011,65412,032,4402,956,0001,180,0002,117,632stderr
5Jun 30, 2026 18:011,69012,113,2042,922,0001,304,0002,117,632stderr
6Jun 30, 2026 18:011,73912,291,3403,144,0001,205,0002,117,632stderr
7Jun 30, 2026 18:011,74612,756,8343,150,0001,216,0002,117,632stderr
8Jun 30, 2026 18:011,75112,724,2143,167,0001,212,0002,117,632stderr
9Jun 30, 2026 18:011,79212,389,5073,175,0001,306,0002,117,632stderr