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:59Victor MerckléVictor MerckléScore: 2,716Success
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 18:012,58116,336,4455,230,0001,223,0002,113,536
2May 29, 2026 18:012,64814,394,9965,375,0001,246,0002,113,536
3May 29, 2026 18:012,70714,594,1425,549,0001,220,0002,113,536
4May 29, 2026 18:012,70915,318,9965,558,0001,216,0002,113,536
5May 29, 2026 18:012,71615,720,1625,559,0001,233,0002,113,536
6May 29, 2026 18:012,72115,631,9585,584,0001,219,0002,113,536
7May 29, 2026 18:012,72614,358,9955,596,0001,220,0002,113,536
8May 29, 2026 18:012,77015,183,1335,676,0001,249,0002,113,536
9May 29, 2026 18:012,77114,625,5285,682,0001,246,0002,113,536