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,367Success
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,23091,802,21957,062,00011,012,0002,510,848
2Dec 29, 2025 16:0427,36792,654,34260,369,0008,049,0002,514,944
3Dec 29, 2025 16:0427,81097,297,89364,486,0005,038,0002,428,928