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 23, 2024 16:02Huy Duc LeHuy Duc LeScore: 332,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2024 16:02331,173885,999,245827,931,60902,301,952
2Feb 23, 2024 16:02332,368892,582,755830,921,00202,289,664
3Feb 23, 2024 16:02341,779916,025,014854,446,51402,285,568