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,343Success
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,32396,665,57961,276,0007,031,0002,502,656
2Dec 29, 2025 16:0727,343100,267,14060,316,0008,042,0002,498,560
3Dec 29, 2025 16:0727,40494,120,75162,466,0006,045,0002,494,464