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 listApr 29, 2024 22:57Joad NacerJoad NacerScore: 1,188,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2024 22:571,185,6113,042,798,7062,964,028,11502,326,528
2Apr 29, 2024 22:571,188,6733,032,711,9222,971,682,93802,203,648
3Apr 29, 2024 22:571,190,5033,032,734,2992,976,256,41002,207,744