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 21:52Kenneth MaplesKenneth MaplesScore: 70,834Success
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 21:5270,778248,808,469176,943,87602,248,704
2Dec 24, 2023 21:5270,834237,483,496177,084,25902,252,800
3Dec 24, 2023 21:5270,882244,424,771177,205,55002,248,704