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 19:41Victor MerckléVictor MerckléScore: 2,697Success
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 19:432,61016,649,0355,207,0001,318,0002,113,536
2May 29, 2026 19:432,63814,183,0165,247,0001,348,0002,113,536
3May 29, 2026 19:432,67314,360,9135,378,0001,306,0002,113,536
4May 29, 2026 19:432,69214,616,6575,419,0001,313,0002,113,536
5May 29, 2026 19:432,69714,422,5785,436,0001,308,0002,113,536
6May 29, 2026 19:432,70715,606,3295,459,0001,310,0002,113,536
7May 29, 2026 19:432,70817,373,6355,463,0001,309,0002,113,536
8May 29, 2026 19:432,71615,441,9015,468,0001,323,0002,113,536
9May 29, 2026 19:432,75215,275,4545,537,0001,344,0002,113,536