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:02Josu San MartinJosu San MartinScore: 27,443Success
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:0227,39597,375,17760,430,0008,057,0002,514,944
2Dec 29, 2025 16:0227,44391,876,14861,546,0007,062,0002,318,336
3Dec 29, 2025 16:0228,00899,075,88064,019,0006,001,0002,514,944