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:49Charlie ShepherdCharlie ShepherdScore: 1,264,604Success
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:491,263,9693,220,337,6733,159,922,34902,252,800
2Jul 28, 2024 09:491,264,6043,224,911,1923,161,510,18802,256,896
3Jul 28, 2024 09:491,265,9103,234,268,7953,164,774,30902,265,088