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 listNov 21, 2023 11:26Franek KortaFranek KortaScore: 1,575,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2023 11:261,573,6464,000,871,6003,934,115,49202,187,264
2Nov 21, 2023 11:261,575,8384,005,134,6043,939,595,47802,256,896
3Nov 21, 2023 11:261,576,7864,010,251,0703,941,964,09002,256,896