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 16:20Kenneth MaplesKenneth MaplesScore: 626,217Success
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 16:20625,7091,622,951,5741,564,272,28102,293,760
2Dec 24, 2023 16:20626,2171,621,321,6451,565,542,02302,293,760
3Dec 24, 2023 16:20627,6911,628,651,0311,569,228,33502,293,760