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 listDec 24, 2023 16:49Oleg KovalovOleg KovalovScore: 4,773,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 16:494,772,77212,007,194,25511,931,930,92502,256,896
2Dec 24, 2023 16:494,773,45511,990,750,42911,933,637,63102,252,800
3Dec 24, 2023 16:494,773,86712,002,902,65711,934,666,25302,256,896