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 19:45Kenneth MaplesKenneth MaplesScore: 255,409Success
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 19:45255,368711,146,165638,420,35702,301,952
2Dec 24, 2023 19:45255,409697,401,875638,523,42402,301,952
3Dec 24, 2023 19:45255,565697,757,191638,911,49102,293,760