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 20, 2026 14:23Victor MerckléVictor MerckléScore: 2,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 14:252,71114,877,1155,429,0001,349,0002,113,536
2May 20, 2026 14:252,71515,798,9205,442,0001,347,0002,113,536
3May 20, 2026 14:252,73114,925,2045,468,0001,361,0002,113,536
4May 20, 2026 14:252,74214,611,4645,492,0001,364,0002,113,536
5May 20, 2026 14:252,75016,056,6555,510,0001,366,0002,113,536
6May 20, 2026 14:252,82216,632,7615,717,0001,340,0002,113,536
7May 20, 2026 14:252,83416,240,2765,745,0001,341,0002,113,536
8May 20, 2026 14:252,84415,556,3345,765,0001,345,0002,113,536
9May 20, 2026 14:252,90617,920,7514,939,0002,327,0002,113,536