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,257,182Success
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,256,9393,203,007,3853,142,348,56602,260,992
2Jul 28, 2024 09:491,257,1823,209,002,4933,142,955,87302,260,992
3Jul 28, 2024 09:491,259,2093,209,374,1823,148,021,93102,260,992