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:36Kenneth MaplesKenneth MaplesScore: 202,167Success
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:36202,130574,705,340505,325,47102,232,320
2Dec 24, 2023 21:36202,167564,630,272505,417,84102,228,224
3Dec 24, 2023 21:36202,288570,547,497505,719,42002,232,320