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 listJun 12, 2026 04:11Victor MerckléVictor MerckléScore: 1,847Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 04:131,73715,096,3213,132,0001,211,0002,113,536
2Jun 12, 2026 04:131,83612,503,1993,375,0001,216,0002,113,536
3Jun 12, 2026 04:131,83813,281,7883,384,0001,213,0002,113,536
4Jun 12, 2026 04:131,84312,642,7673,370,0001,238,0002,113,536
5Jun 12, 2026 04:131,84712,555,6973,403,0001,216,0002,113,536
6Jun 12, 2026 04:131,87612,420,5853,469,0001,223,0002,113,536
7Jun 12, 2026 04:131,89312,430,3623,313,0001,420,0002,113,536
8Jun 12, 2026 04:131,94412,865,4403,470,0001,392,0002,113,536
9Jun 12, 2026 04:131,95012,888,0093,486,0001,391,0002,113,536