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 19:24Kenneth MaplesKenneth MaplesScore: 512,289Success
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 19:24512,1891,349,289,4191,280,473,32702,183,168
2Dec 24, 2023 19:24512,2891,339,544,8781,280,721,82202,195,456
3Dec 24, 2023 19:24512,3171,339,522,1961,280,792,02402,191,360