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:10Josu San MartinJosu San MartinScore: 27,317Success
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:1027,17592,875,80261,944,0005,994,0002,359,296
2Dec 29, 2025 16:1027,317102,422,33861,263,0007,030,0002,527,232
3Dec 29, 2025 16:1027,42692,028,59563,524,0005,041,0002,514,944