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 14, 2026 12:47Victor MerckléVictor MerckléScore: 1,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 12:481,71812,062,3103,082,0001,213,0002,113,536
2Jun 14, 2026 12:481,74811,997,6963,149,0001,221,0002,113,536
3Jun 14, 2026 12:481,76212,044,5253,176,0001,229,0002,113,536
4Jun 14, 2026 12:481,76212,056,8193,183,0001,224,0002,113,536
5Jun 14, 2026 12:481,76512,040,1133,175,0001,239,0002,113,536
6Jun 14, 2026 12:481,77012,086,8343,196,0001,231,0002,113,536
7Jun 14, 2026 12:481,79011,969,5313,252,0001,225,0002,113,536
8Jun 14, 2026 12:481,79312,149,0363,253,0001,231,0002,113,536
9Jun 14, 2026 12:481,88512,397,0113,542,0001,171,0002,113,536