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 03:28Victor MerckléVictor MerckléScore: 2,303Success
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 03:302,22813,282,3714,340,0001,230,0002,113,536
2Jun 2, 2026 03:302,22813,214,6264,336,0001,234,0002,113,536
3Jun 2, 2026 03:302,23613,279,6044,351,0001,241,0002,113,536
4Jun 2, 2026 03:302,23814,621,0974,357,0001,240,0002,113,536
5Jun 2, 2026 03:302,30313,458,5524,508,0001,250,0002,113,536
6Jun 2, 2026 03:302,30414,493,4674,523,0001,239,0002,113,536
7Jun 2, 2026 03:302,30613,838,8184,532,0001,235,0002,113,536
8Jun 2, 2026 03:302,32413,436,4544,570,0001,242,0002,113,536
9Jun 2, 2026 03:302,37013,596,2333,818,0002,107,0002,113,536