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 08:52Victor MerckléVictor MerckléScore: 2,229Success
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 08:542,14913,040,2484,134,0001,240,0002,113,536
2Jun 2, 2026 08:542,15714,470,7334,153,0001,240,0002,113,536
3Jun 2, 2026 08:542,16813,051,0764,172,0001,248,0002,113,536
4Jun 2, 2026 08:542,21813,166,0634,303,0001,242,0002,113,536
5Jun 2, 2026 08:542,22913,188,3824,326,0001,248,0002,113,536
6Jun 2, 2026 08:542,23513,147,4474,345,0001,244,0002,113,536
7Jun 2, 2026 08:542,23813,531,9264,353,0001,242,0002,113,536
8Jun 2, 2026 08:542,24313,531,3174,358,0001,251,0002,113,536
9Jun 2, 2026 08:542,30413,288,0523,648,0002,113,0002,113,536