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:21Franek KortaFranek KortaScore: 1,573,228Success
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:211,573,1953,991,467,7273,932,986,76302,224,128
2Nov 21, 2023 11:211,573,2283,996,159,1803,933,070,96502,228,224
3Nov 21, 2023 11:211,573,3504,001,010,4063,933,374,78902,236,416