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 17:41Victor MerckléVictor MerckléScore: 2,686Success
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 17:432,56014,358,3105,088,0001,312,0002,113,536
2May 29, 2026 17:432,57914,667,2985,130,0001,319,0002,113,536
3May 29, 2026 17:432,58215,969,8985,136,0001,320,0002,113,536
4May 29, 2026 17:432,63214,924,5475,236,0001,346,0002,113,536
5May 29, 2026 17:432,68614,472,9615,411,0001,306,0002,113,536
6May 29, 2026 17:432,68814,486,2175,401,0001,320,0002,113,536
7May 29, 2026 17:432,70014,457,9985,445,0001,306,0002,113,536
8May 29, 2026 17:432,70916,879,8055,447,0001,326,0002,113,536
9May 29, 2026 17:432,70914,718,9555,463,0001,311,0002,113,536