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 30, 2025 05:43Josu San MartinJosu San MartinScore: 60,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 05:4360,304178,373,880145,768,0004,992,0002,527,232
2Dec 30, 2025 05:4360,364175,404,453147,911,0002,998,0002,514,944
3Dec 30, 2025 05:4360,634180,984,543145,561,0006,023,0002,514,944