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 20, 2023 17:33Yuriy LyfenkoYuriy LyfenkoScore: 64,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2023 17:3364,136189,359,863149,318,00011,023,0002,330,624
2Nov 20, 2023 17:3364,144188,296,445152,342,0008,018,0002,412,544
3Nov 20, 2023 17:3364,147186,715,925155,356,0005,011,0002,437,120
4Nov 20, 2023 17:3364,181185,369,044149,421,00011,031,0002,400,256
5Nov 20, 2023 17:3364,320184,412,174153,810,0006,991,0002,498,560
6Nov 20, 2023 17:3364,322184,121,128151,815,0008,989,0002,400,256
7Nov 20, 2023 17:3364,547189,150,191150,343,00011,025,0002,277,376
8Nov 20, 2023 17:3364,581185,293,868152,428,0009,025,0002,342,912
9Nov 20, 2023 17:3366,918229,649,481167,295,12402,273,280
10Nov 20, 2023 17:3367,050231,838,235167,626,20202,232,320
11Nov 20, 2023 17:3367,727234,496,352169,317,83302,281,472
12Nov 20, 2023 17:3369,044201,636,779164,583,0008,028,0002,285,568