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 listMay 16, 2026 20:43Jacob McDanielJacob McDanielScore: 1,090,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 20:481,086,6122,725,685,8512,714,479,0002,051,0002,113,536
2May 16, 2026 20:481,088,0642,729,254,8012,719,155,0001,007,0002,113,536
3May 16, 2026 20:481,088,0842,729,002,4902,718,972,0001,239,0002,113,536
4May 16, 2026 20:481,089,5172,734,774,4342,722,543,0001,251,0002,113,536
5May 16, 2026 20:481,090,6212,735,561,4612,725,285,0001,269,0002,113,536
6May 16, 2026 20:481,090,7502,736,157,2382,725,730,0001,145,0002,113,536
7May 16, 2026 20:481,090,7702,738,644,2632,725,645,0001,280,0002,113,536
8May 16, 2026 20:481,091,0962,740,142,0342,726,560,0001,180,0002,113,536
9May 16, 2026 20:481,091,3482,739,229,1002,727,115,0001,255,0002,113,536