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 15:58Josu San MartinJosu San MartinScore: 27,421Success
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 15:5827,38298,300,82163,423,0005,033,0002,510,848
2Dec 29, 2025 15:5827,42196,330,45359,479,0009,073,0002,527,232
3Dec 29, 2025 15:5827,76995,268,46263,387,0006,036,0002,506,752