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:09Sergey StreminSergey StreminScore: 49,776Success
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:0949,526151,137,861120,820,0002,995,0002,293,760
2Dec 3, 2023 20:0949,570150,043,476119,927,0003,997,0002,371,584
3Dec 3, 2023 20:0949,657195,621,581124,142,00202,260,992
4Dec 3, 2023 20:0949,667187,058,609124,167,30602,301,952
5Dec 3, 2023 20:0949,735151,339,043120,327,0004,010,0002,473,984
6Dec 3, 2023 20:0949,767148,437,233120,405,0004,013,0002,514,944
7Dec 3, 2023 20:0949,776153,689,206120,426,0004,014,0002,326,528
8Dec 3, 2023 20:0949,781153,730,361120,438,0004,014,0002,306,048
9Dec 3, 2023 20:0949,783152,171,729119,439,0005,018,0002,506,752
10Dec 3, 2023 20:0949,922155,013,553120,812,0003,993,0002,461,696
11Dec 3, 2023 20:0949,924151,999,501121,815,0002,995,0002,412,544
12Dec 3, 2023 20:0950,546177,749,970126,365,24702,281,472