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:02Josu San MartinJosu San MartinScore: 27,470Success
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:0227,36794,285,24163,388,0005,030,0002,285,568
2Dec 29, 2025 16:0227,47095,559,71559,587,0009,089,0002,347,008
3Dec 29, 2025 16:0228,86096,880,33865,136,0007,014,0002,469,888