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 listJul 30, 2024 13:34matsuoka-601matsuoka-601Score: 3,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2024 13:343,81758,071,2969,542,21302,260,992
2Jul 30, 2024 13:353,83147,471,0769,576,31702,281,472
3Jul 30, 2024 13:343,84351,281,6039,607,31902,273,280
4Jul 30, 2024 13:343,84559,277,7189,611,34802,277,376
5Jul 30, 2024 13:353,87755,730,9529,692,38202,285,568
6Jul 30, 2024 13:353,88526,322,6305,396,0004,317,0002,306,048
7Jul 30, 2024 13:353,90025,781,7968,668,0001,083,0002,387,968
8Jul 30, 2024 13:353,90157,716,2049,752,82502,281,472
9Jul 30, 2024 13:353,96329,379,5637,926,0001,981,0002,433,024
10Jul 30, 2024 13:343,97128,820,3976,950,0002,978,0002,457,600
11Jul 30, 2024 13:353,97326,855,5605,960,0003,973,0002,408,448
12Jul 30, 2024 13:343,99027,376,7855,985,0003,990,0002,297,856
13Jul 30, 2024 13:343,99024,277,5696,982,0002,992,0002,289,664
14Jul 30, 2024 13:353,99230,944,1926,987,0002,994,0002,306,048
15Jul 30, 2024 13:343,99526,377,2136,992,0002,996,0002,301,952
16Jul 30, 2024 13:344,03629,727,8868,073,0002,018,0002,404,352
17Jul 30, 2024 13:344,05125,548,1317,090,0003,038,0002,301,952
18Jul 30, 2024 13:344,10429,183,3897,183,0003,078,0002,301,952
19Jul 30, 2024 13:344,11326,478,8738,226,0002,056,0002,301,952
20Jul 30, 2024 13:354,12627,267,4098,252,0002,063,0002,293,760
21Jul 30, 2024 13:354,13224,827,2998,265,0002,066,0002,301,952
22Jul 30, 2024 13:344,17724,270,0558,355,0002,088,0002,347,008
23Jul 30, 2024 13:354,22930,132,9087,401,0003,172,0002,396,160
24Jul 30, 2024 13:354,23231,920,7736,348,0004,232,0002,514,944