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 23, 2025 05:45Josu San MartinJosu San MartinScore: 31,803Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 05:4531,717105,656,74271,263,0008,029,0002,478,080
2Dec 23, 2025 05:4531,803109,393,65471,457,0008,051,0002,502,656
3Dec 23, 2025 05:4532,213110,332,02773,487,0007,046,0002,469,888