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:04Kenneth MaplesKenneth MaplesScore: 246,694Success
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:04246,659677,832,346616,646,81302,211,840
2Dec 24, 2023 20:04246,694675,925,985616,735,18202,301,952
3Dec 24, 2023 20:04246,771681,215,746616,927,51202,301,952