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 listFeb 24, 2024 03:32Huy Duc LeHuy Duc LeScore: 331,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2024 03:32331,197882,564,309827,993,04402,281,472
2Feb 24, 2024 03:32331,279884,005,069828,196,57102,310,144
3Feb 24, 2024 03:32332,145889,872,319830,363,03202,293,760