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 30, 2025 05:37Josu San MartinJosu San MartinScore: 60,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 05:3760,227182,454,430147,557,0003,011,0002,523,136
2Dec 30, 2025 05:3760,324177,419,477147,815,0002,996,0002,310,144
3Dec 30, 2025 05:3760,704176,434,261149,764,0001,996,0002,306,048