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 listJan 23, 2024 16:48AnSaAnSaScore: 1,574,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2024 16:481,573,6663,998,978,7913,934,165,90402,183,168
2Jan 23, 2024 16:481,574,3064,002,745,1893,935,764,61902,179,072
3Jan 23, 2024 16:481,575,8213,985,709,3813,939,552,75102,183,168