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 listDec 29, 2025 16:03Josu San MartinJosu San MartinScore: 27,366Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 16:0327,33598,531,63161,304,0007,034,0002,514,944
2Dec 29, 2025 16:0327,366100,135,57760,367,0008,048,0002,359,296
3Dec 29, 2025 16:0327,42895,650,88362,519,0006,050,0002,334,720