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:04Kenneth MaplesKenneth MaplesScore: 63,934Success
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:0463,780182,819,688148,418,00011,031,0002,486,272
2Dec 24, 2023 22:0463,782182,042,748150,429,0009,025,0002,334,720
3Dec 24, 2023 22:0463,815186,054,397154,521,0005,016,0002,408,448
4Dec 24, 2023 22:0463,822187,242,413154,538,0005,017,0002,408,448
5Dec 24, 2023 22:0463,825191,489,138151,534,0008,028,0002,404,352
6Dec 24, 2023 22:0463,880181,385,723147,722,00011,977,0002,486,272
7Dec 24, 2023 22:0463,934187,822,674147,847,00011,987,0002,404,352
8Dec 24, 2023 22:0463,960186,394,088148,908,00010,993,0002,482,176
9Dec 24, 2023 22:0463,997187,815,499152,993,0006,999,0002,473,984
10Dec 24, 2023 22:0465,644227,582,967164,110,98602,195,456
11Dec 24, 2023 22:0465,648225,680,296164,120,58202,195,456
12Dec 24, 2023 22:0465,811227,907,478164,528,63402,195,456