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:22Victor MerckléVictor MerckléScore: 2,644Success
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:242,57815,092,1445,137,0001,310,0002,113,536
2May 29, 2026 17:242,58116,411,5465,145,0001,309,0002,113,536
3May 29, 2026 17:242,58214,349,7755,142,0001,313,0002,113,536
4May 29, 2026 17:242,60316,620,1955,193,0001,316,0002,113,536
5May 29, 2026 17:242,64416,040,3295,266,0001,345,0002,113,536
6May 29, 2026 17:242,70415,140,3835,454,0001,308,0002,113,536
7May 29, 2026 17:242,70716,583,0325,459,0001,309,0002,113,536
8May 29, 2026 17:242,75014,422,7965,538,0001,338,0002,113,536
9May 29, 2026 17:242,75315,681,9975,544,0001,340,0002,113,536