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 listNov 16, 2025 13:58Aniruddha DebAniruddha DebScore: 8,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 16, 2025 13:588,73745,476,50317,871,0003,971,0002,347,008
2Nov 16, 2025 13:588,74351,589,78916,891,0004,967,0002,334,720
3Nov 16, 2025 13:588,76537,379,59717,928,0003,984,0002,347,008