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 listOct 16, 2024 10:26Huy Duc LeHuy Duc LeScore: 25,006Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 10:2624,99086,472,34754,415,0008,061,0002,363,392
2Oct 16, 2024 10:2625,00690,173,70251,425,00011,091,0002,306,048
3Oct 16, 2024 10:2625,17889,196,64951,956,00010,990,0002,277,376