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,286Success
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,21195,373,50763,025,0005,002,0002,514,944
2Dec 29, 2025 15:5827,28693,528,88263,199,0005,015,0002,277,376
3Dec 29, 2025 15:5827,54897,304,00762,881,0005,988,0002,519,040