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 listJan 31, 2024 13:49AnSaAnSaScore: 1,611,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2024 13:491,609,6594,091,443,4474,024,147,93802,293,760
2Jan 31, 2024 13:491,611,0074,084,701,7854,027,516,59602,301,952
3Jan 31, 2024 13:491,611,5564,087,893,7954,028,889,24002,252,800