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 13:30Victor MerckléVictor MerckléScore: 2,212Success
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 13:322,14313,012,7334,119,0001,240,0002,113,536
2Jun 2, 2026 13:322,14412,999,5444,118,0001,244,0002,113,536
3Jun 2, 2026 13:322,14613,056,6434,119,0001,248,0002,113,536
4Jun 2, 2026 13:322,21213,173,9954,283,0001,247,0002,113,536
5Jun 2, 2026 13:322,21213,203,5264,288,0001,243,0002,113,536
6Jun 2, 2026 13:322,22313,533,6334,310,0001,248,0002,113,536
7Jun 2, 2026 13:322,22813,517,8964,318,0001,252,0002,113,536
8Jun 2, 2026 13:322,23513,213,5664,333,0001,255,0002,113,536
9Jun 2, 2026 13:322,24513,605,2084,360,0001,254,0002,113,536