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:04Josu San MartinJosu San MartinScore: 27,382Success
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:0427,30889,492,47760,239,0008,031,0002,514,944
2Dec 29, 2025 16:0427,38294,060,38259,396,0009,060,0002,519,040
3Dec 29, 2025 16:0427,67498,951,79162,166,0007,018,0002,359,296