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 2, 2026 12:38Victor MerckléVictor MerckléScore: 2,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 12:402,15414,234,7014,148,0001,237,0002,113,536
2Jun 2, 2026 12:402,22613,239,8054,286,0001,280,0002,113,536
3Jun 2, 2026 12:402,22813,196,3044,291,0001,280,0002,113,536
4Jun 2, 2026 12:402,24013,193,9004,360,0001,241,0002,113,536
5Jun 2, 2026 12:402,24213,230,8904,361,0001,245,0002,113,536
6Jun 2, 2026 12:402,24813,262,6484,372,0001,249,0002,113,536
7Jun 2, 2026 12:402,25213,272,0404,385,0001,245,0002,113,536
8Jun 2, 2026 12:402,29713,404,1874,470,0001,273,0002,113,536
9Jun 2, 2026 12:402,30413,786,9233,671,0002,091,0002,113,536