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 28, 2024 09:56Charlie ShepherdCharlie ShepherdScore: 1,295,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2024 09:561,294,8643,295,847,6753,237,160,08702,367,488
2Jul 28, 2024 09:561,295,0713,291,925,9503,237,676,40102,240,512
3Jul 28, 2024 09:561,296,1813,307,676,4763,240,452,30802,260,992