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:08Josu San MartinJosu San MartinScore: 27,411Success
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:0827,33298,732,40660,292,0008,039,0002,506,752
2Dec 29, 2025 16:0827,41197,540,12662,481,0006,046,0002,514,944
3Dec 29, 2025 16:0827,42096,724,04063,510,0005,040,0002,527,232