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 4, 2024 15:06Oleg KovalovOleg KovalovScore: 1,682,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2024 15:061,682,7424,279,798,6404,206,854,32202,269,184
2Jan 4, 2024 15:061,682,8424,275,308,0464,207,105,50302,252,800
3Jan 4, 2024 15:061,682,9274,276,740,2414,207,317,47002,252,800