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:07Josu San MartinJosu San MartinScore: 27,463Success
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:0727,36096,458,83959,347,0009,053,0002,514,944
2Dec 29, 2025 16:0727,46392,678,08859,571,0009,087,0002,510,848
3Dec 29, 2025 16:0727,94897,916,34859,888,0009,981,0002,510,848