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 24, 2023 21:47Kenneth MaplesKenneth MaplesScore: 63,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 21:4763,002187,217,330147,473,00010,032,0002,412,544
2Dec 24, 2023 21:4763,140187,010,354147,860,0009,990,0002,420,736
3Dec 24, 2023 21:4763,150181,173,880151,879,0005,995,0002,383,872
4Dec 24, 2023 21:4763,206186,533,341152,016,0006,000,0002,420,736
5Dec 24, 2023 21:4763,221182,785,596149,050,0009,003,0002,523,136
6Dec 24, 2023 21:4763,350181,063,248145,345,00013,030,0002,428,928
7Dec 24, 2023 21:4763,354182,299,573150,367,0008,019,0002,420,736
8Dec 24, 2023 21:4763,365180,219,217151,394,0007,018,0002,383,872
9Dec 24, 2023 21:4763,423179,310,999147,520,00011,038,0002,514,944
10Dec 24, 2023 21:4765,655222,120,771164,138,01902,260,992
11Dec 24, 2023 21:4765,716224,758,795164,289,60702,269,184
12Dec 24, 2023 21:4765,733227,707,323164,331,41702,265,088