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:02Kenneth MaplesKenneth MaplesScore: 246,805Success
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:02246,698676,927,302616,745,31702,297,856
2Dec 24, 2023 20:02246,805671,728,766617,012,19502,211,840
3Dec 24, 2023 20:02246,831668,852,070617,078,50302,215,936