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 30, 2026 08:24Victor MerckléVictor MerckléScore: 2,634Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 08:262,54215,799,1605,018,0001,339,0002,113,536
2May 30, 2026 08:262,56416,058,2885,060,0001,351,0002,113,536
3May 30, 2026 08:262,60617,196,5495,184,0001,332,0002,113,536
4May 30, 2026 08:262,61715,338,6525,219,0001,325,0002,113,536
5May 30, 2026 08:262,63415,248,2815,254,0001,333,0002,113,536
6May 30, 2026 08:262,63415,083,4115,252,0001,335,0002,113,536
7May 30, 2026 08:262,64016,507,5175,266,0001,335,0002,113,536
8May 30, 2026 08:262,64815,047,3505,286,0001,334,0002,113,536
9May 30, 2026 08:262,69117,480,0634,437,0002,292,0002,113,536