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 27, 2024 15:51Joad NacerJoad NacerScore: 34,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2024 15:5134,840119,983,38285,098,0002,002,0002,289,664
2Nov 27, 2024 15:5134,873118,102,04584,177,0003,006,0002,486,272
3Nov 27, 2024 15:5135,095117,144,91784,746,0002,991,0002,396,160