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 listAug 18, 2024 13:46Chandrasekaran AkashChandrasekaran AkashScore: 1,575,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2024 13:461,574,6204,005,652,9813,936,550,28302,318,336
2Aug 18, 2024 13:461,575,2064,002,234,7323,938,014,44002,183,168
3Aug 18, 2024 13:461,575,7244,006,763,5023,939,309,55002,191,360