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:03Josu San MartinJosu San MartinScore: 27,474Success
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:0327,44697,545,82561,551,0007,063,0002,490,368
2Dec 29, 2025 16:0327,47498,755,63760,605,0008,080,0002,514,944
3Dec 29, 2025 16:0327,48895,351,86564,679,0004,042,0002,519,040