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:48AnSaAnSaScore: 1,713,959Success
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:481,713,2204,350,835,0124,283,049,01902,277,376
2Jan 31, 2024 13:481,713,9594,345,358,4504,284,897,04602,273,280
3Jan 31, 2024 13:481,714,7824,345,805,9884,286,956,10502,281,472