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.

Date AuthorLanguageStatus Score
Jul 9, 2023 23:08gchebanovgchebanovCPPg++9.3.0Success16,834+157.10 RP
Jul 9, 2023 23:05gchebanovgchebanovCPPg++9.3.0Success19,994
Jul 9, 2023 22:59gchebanovgchebanovCPPclang++10.0.0Success33,678
Jul 9, 2023 22:21gchebanovgchebanovCPPclang++10.0.0Success22,104
Jul 9, 2023 22:21gchebanovgchebanovCPPg++9.3.0Success19,399+321.86 RP
Jul 9, 2023 22:10gchebanovgchebanovCPPg++9.3.0Success28,204+383.98 RP
Jul 9, 2023 21:19gchebanovgchebanovCPPg++9.3.0Success2,118,709
Jul 9, 2023 21:17gchebanovgchebanovCPPg++9.3.0Error
Jul 9, 2023 21:13gchebanovgchebanovCPPg++9.3.0Error
Jul 9, 2023 21:08gchebanovgchebanovCPPg++9.3.0Success1,345,983+7.43 RP
Jul 9, 2023 20:59gchebanovgchebanovCPPg++9.3.0Error
Jul 9, 2023 18:30Bernard TeoBernard TeoCPPg++9.3.0Success31,475+47.38 RP
Jul 9, 2023 18:30Bernard TeoBernard TeoCPPg++9.3.0Success34,011+574.07 RP
Jul 9, 2023 18:29Bernard TeoBernard TeoRUSTrust-1.70.0Success1,262,258+1.87 RP
Jul 9, 2023 18:29Bernard TeoBernard TeoCPPg++9.3.0Success1,652,013+6.05 RP