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,400Success
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,30892,765,04059,234,0009,035,0002,514,944
2Dec 29, 2025 15:5827,40093,465,11258,428,00010,073,0002,306,048
3Dec 29, 2025 15:5827,42897,767,21359,496,0009,075,0002,506,752