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 29, 2023 14:56matsuoka-601matsuoka-601Score: 4,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2023 14:563,81658,930,2019,539,83802,260,992
2Dec 29, 2023 14:563,82488,203,1549,559,96602,273,280
3Dec 29, 2023 14:563,85063,067,8229,624,10502,256,896
4Dec 29, 2023 14:564,12426,547,3236,186,0004,124,0002,314,240
5Dec 29, 2023 14:564,13131,320,8195,164,0005,164,0002,396,160
6Dec 29, 2023 14:564,14227,562,5406,214,0004,142,0002,408,448
7Dec 29, 2023 14:564,14432,213,6117,253,0003,108,0002,433,024
8Dec 29, 2023 14:564,17425,715,1877,304,0003,130,0002,408,448
9Dec 29, 2023 14:564,24231,263,9676,363,0004,242,0002,514,944
10Dec 29, 2023 14:564,24328,192,5956,365,0004,243,0002,412,544
11Dec 29, 2023 14:564,24527,692,5087,429,0003,184,0002,445,312
12Dec 29, 2023 14:564,58633,292,9895,212,0006,254,0002,326,528