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:10Kenneth MaplesKenneth MaplesScore: 302,319Success
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:10302,164813,393,230755,410,65502,187,264
2Dec 24, 2023 20:10302,319813,773,394755,798,41102,195,456
3Dec 24, 2023 20:10302,336819,812,344755,840,04902,187,264