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 listNov 26, 2023 17:37mmalczakmmalczakScore: 1,651,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2023 17:371,651,2414,194,296,1024,128,103,45302,179,072
2Nov 26, 2023 17:371,651,5784,210,892,1254,128,945,21802,187,264
3Nov 26, 2023 17:371,651,6234,189,419,6624,129,056,66502,179,072