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:07Kenneth MaplesKenneth MaplesScore: 981,399Success
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:07980,6952,504,053,1432,451,737,96402,199,552
2Dec 24, 2023 19:07981,3992,516,747,7352,453,496,47602,203,648
3Dec 24, 2023 19:07981,5792,505,167,3452,453,948,62402,211,840