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:51Kenneth MaplesKenneth MaplesScore: 71,061Success
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:5170,957238,550,539177,393,72902,240,512
2Dec 24, 2023 21:5171,061236,489,836177,652,14602,256,896
3Dec 24, 2023 21:5171,109241,274,005177,773,25902,252,800