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 13:35Victor MerckléVictor MerckléScore: 1,870Success
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 13:351,72211,927,7353,092,0001,215,0002,113,536
2Jun 14, 2026 13:351,72711,963,3663,099,0001,219,0002,113,536
3Jun 14, 2026 13:351,78112,081,1043,221,0001,233,0002,113,536
4Jun 14, 2026 13:351,84612,407,2863,383,0001,232,0002,113,536
5Jun 14, 2026 13:351,87012,345,4493,434,0001,242,0002,113,536
6Jun 14, 2026 13:351,87112,281,8863,448,0001,230,0002,113,536
7Jun 14, 2026 13:351,88112,445,7493,478,0001,225,0002,113,536
8Jun 14, 2026 13:351,89212,580,8693,447,0001,283,0002,113,536
9Jun 14, 2026 13:351,89512,346,1333,481,0001,257,0002,113,536