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 14:54Josu San MartinJosu San MartinScore: 27,419Success
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 14:5427,39792,194,73159,428,0009,065,0002,371,584
2Dec 29, 2025 14:5427,41999,663,50862,500,0006,048,0002,514,944
3Dec 29, 2025 14:5428,23899,716,12963,537,0007,059,0002,347,008