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 30, 2025 08:23Oleg KovalovOleg KovalovScore: 34,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2025 08:2333,956112,545,53182,893,0001,997,0002,473,984
2Jan 30, 2025 08:2333,982110,266,44581,956,0002,998,0002,478,080
3Jan 30, 2025 08:2333,984110,752,28479,963,0004,997,0002,473,984
4Jan 30, 2025 08:2333,995110,759,57479,988,0004,999,0002,510,848
5Jan 30, 2025 08:2334,000114,441,23781,000,0004,000,0002,514,944
6Jan 30, 2025 08:2334,016110,386,47682,039,0003,001,0002,478,080
7Jan 30, 2025 08:2334,030107,208,83782,072,0003,002,0002,473,984
8Jan 30, 2025 08:2334,086113,696,77882,209,0003,007,0002,473,984
9Jan 30, 2025 08:2334,239116,775,62582,612,0002,985,0002,469,888