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 listJul 30, 2024 15:28DanielDanielScore: 1,264,951Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2024 15:281,264,4933,233,304,4333,161,232,46202,273,280
2Jul 30, 2024 15:281,264,9513,223,771,1203,162,378,05502,392,064
3Jul 30, 2024 15:281,266,9683,226,532,3293,167,419,73602,383,872