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,386Success
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,22396,004,61158,049,00010,008,0002,310,144
2Dec 29, 2025 16:1027,38697,305,03159,405,0009,061,0002,514,944
3Dec 29, 2025 16:1027,77693,794,30059,376,00010,063,0002,519,040