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 listOct 7, 2024 20:53Joad NacerJoad NacerScore: 1,299,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2024 20:531,297,4873,268,316,0143,241,719,0001,998,0002,289,664
2Oct 7, 2024 20:531,299,6263,273,892,7373,247,066,0001,998,0002,301,952
3Oct 7, 2024 20:531,308,3603,297,446,8753,268,902,0001,998,0002,400,256