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 6, 2024 07:04Mikhail ShirokovMikhail ShirokovScore: 689,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 07:04686,9051,742,483,6901,715,266,0001,997,0002,306,048
2Nov 6, 2024 07:04687,8861,745,205,4601,717,718,0001,998,0002,441,216
3Nov 6, 2024 07:04688,1861,747,629,9461,719,465,000999,0002,306,048
4Nov 6, 2024 07:04688,7501,746,979,4391,718,877,0002,998,0002,396,160
5Nov 6, 2024 07:04689,2121,750,391,3621,722,031,000999,0002,293,760
6Nov 6, 2024 07:04689,5371,750,260,6861,721,844,0001,998,0002,306,048
7Nov 6, 2024 07:04689,5681,753,830,0051,720,922,0002,998,0002,306,048
8Nov 6, 2024 07:04689,6741,749,887,9971,722,187,0001,999,0002,306,048
9Nov 6, 2024 07:04690,5931,751,189,2821,725,484,000999,0002,445,312