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 02:56Victor MerckléVictor MerckléScore: 2,320Success
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 02:582,28215,625,9364,460,0001,247,0002,113,536
2Jun 2, 2026 02:582,30713,677,1884,487,0001,281,0002,113,536
3Jun 2, 2026 02:582,31615,151,6264,557,0001,235,0002,113,536
4Jun 2, 2026 02:582,31813,450,0254,562,0001,234,0002,113,536
5Jun 2, 2026 02:582,32013,417,1354,560,0001,241,0002,113,536
6Jun 2, 2026 02:582,32913,817,7614,573,0001,250,0002,113,536
7Jun 2, 2026 02:582,33113,423,4954,584,0001,245,0002,113,536
8Jun 2, 2026 02:582,34513,500,3974,603,0001,261,0002,113,536
9Jun 2, 2026 02:582,35013,681,3634,621,0001,255,0002,113,536