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 listDec 16, 2023 03:38Kenneth MaplesKenneth MaplesScore: 1,574,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 16, 2023 03:381,573,8683,979,814,4863,934,670,30702,183,168
2Dec 16, 2023 03:381,574,8684,007,227,1203,937,169,24802,252,800
3Dec 16, 2023 03:381,575,0033,994,470,3903,937,507,35602,256,896