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 22:12Kenneth MaplesKenneth MaplesScore: 51,142Success
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 22:1250,926152,014,308119,297,0008,019,0002,478,080
2Dec 24, 2023 22:1250,963155,445,065113,363,00014,044,0002,392,064
3Dec 24, 2023 22:1250,972149,387,017119,402,0008,027,0002,482,176
4Dec 24, 2023 22:1251,058152,327,257118,600,0009,045,0002,461,696
5Dec 24, 2023 22:1251,066151,442,545118,618,0009,047,0002,379,776
6Dec 24, 2023 22:1251,080151,369,057117,645,00010,055,0002,473,984
7Dec 24, 2023 22:1251,142153,838,986118,865,0008,989,0002,478,080
8Dec 24, 2023 22:1251,146154,313,297120,819,0007,047,0002,379,776
9Dec 24, 2023 22:1251,161155,370,627118,909,0008,993,0002,482,176
10Dec 24, 2023 22:1276,075254,674,784190,188,64602,195,456
11Dec 24, 2023 22:1276,201242,128,775190,502,73202,191,360
12Dec 24, 2023 22:1276,270260,983,868190,674,43102,195,456