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 21:47Victor MerckléVictor MerckléScore: 13,588Success
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 21:4913,04041,722,61828,556,0004,044,0002,117,632
2Jun 13, 2026 21:4913,42642,744,49329,461,0004,105,0002,117,632
3Jun 13, 2026 21:4913,48642,882,61830,611,0003,106,0002,117,632
4Jun 13, 2026 21:4913,57843,015,77429,894,0004,052,0002,117,632
5Jun 13, 2026 21:4913,58843,090,26329,928,0004,043,0002,117,632
6Jun 13, 2026 21:4913,61643,192,72029,978,0004,062,0002,117,632
7Jun 13, 2026 21:4913,67943,366,71330,127,0004,071,0002,117,632
8Jun 13, 2026 21:4913,69043,312,21530,180,0004,047,0002,117,632
9Jun 13, 2026 21:4913,83243,763,65630,531,0004,049,0002,117,632