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 17, 2026 06:35Jacob McDanielJacob McDanielScore: 8,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:368,53031,798,18619,148,0002,179,0002,113,536
2May 17, 2026 06:368,56332,350,77219,228,0002,181,0002,113,536
3May 17, 2026 06:368,65032,116,97819,465,0002,162,0002,113,536
4May 17, 2026 06:368,67433,476,92319,536,0002,151,0002,113,536
5May 17, 2026 06:368,69531,416,07219,546,0002,192,0002,113,536
6May 17, 2026 06:368,70530,835,76719,627,0002,137,0002,113,536
7May 17, 2026 06:368,71131,458,04019,562,0002,216,0002,113,536
8May 17, 2026 06:368,71230,639,18219,588,0002,192,0002,113,536
9May 17, 2026 06:368,78432,415,49619,761,0002,200,0002,113,536