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 20:21Kenneth MaplesKenneth MaplesScore: 246,893Success
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 20:21246,868678,421,983617,170,51902,191,360
2Dec 24, 2023 20:21246,893699,618,598617,232,50802,195,456
3Dec 24, 2023 20:21246,982683,114,748617,455,32102,191,360