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:07Josu San MartinJosu San MartinScore: 27,364Success
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:0727,32694,319,53361,284,0007,032,0002,506,752
2Dec 29, 2025 16:0727,36492,370,64061,368,0007,042,0002,301,952
3Dec 29, 2025 16:0727,58498,324,58157,967,00010,993,0002,273,280