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 13, 2026 19:13Victor MerckléVictor MerckléScore: 17,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 19:1917,19850,490,71541,961,0001,036,0002,113,536
2Jun 13, 2026 19:1917,22150,592,34142,017,0001,036,0002,113,536
3Jun 13, 2026 19:1917,27450,592,90342,149,0001,038,0002,113,536
4Jun 13, 2026 19:1917,28050,731,90542,163,0001,038,0002,113,536
5Jun 13, 2026 19:1917,30250,745,74142,219,0001,038,0002,113,536
6Jun 13, 2026 19:1917,31450,698,49842,248,0001,038,0002,113,536
7Jun 13, 2026 19:1917,31850,831,41442,258,0001,037,0002,113,536
8Jun 13, 2026 19:1917,32450,805,79942,275,0001,035,0002,113,536
9Jun 13, 2026 19:1917,35951,020,14642,359,0001,039,0002,113,536