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 listDec 3, 2023 20:08Sergey StreminSergey StreminScore: 49,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2023 20:0849,529148,915,431119,828,0003,994,0002,396,160
2Dec 3, 2023 20:0849,537192,554,393123,843,15202,301,952
3Dec 3, 2023 20:0849,564153,501,389121,913,0001,998,0002,379,776
4Dec 3, 2023 20:0849,647149,086,176121,116,0003,002,0002,510,848
5Dec 3, 2023 20:0849,688155,406,133119,213,0005,008,0002,478,080
6Dec 3, 2023 20:0849,691159,849,064121,222,0003,005,0002,494,464
7Dec 3, 2023 20:0849,704192,956,985124,260,19802,240,512
8Dec 3, 2023 20:0849,738156,884,228121,336,0003,008,0002,457,600
9Dec 3, 2023 20:0849,751154,339,682119,363,0005,015,0002,379,776
10Dec 3, 2023 20:0849,869153,308,501121,657,0003,016,0002,363,392
11Dec 3, 2023 20:0849,930152,351,430121,829,0002,995,0002,371,584
12Dec 3, 2023 20:0850,529187,833,097126,323,22802,265,088