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:56Kenneth MaplesKenneth MaplesScore: 63,674Success
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:5663,407180,241,572145,475,00013,042,0002,441,216
2Dec 24, 2023 21:5663,419185,998,534150,521,0008,027,0002,482,176
3Dec 24, 2023 21:5663,444188,515,153147,568,00011,042,0002,297,856
4Dec 24, 2023 21:5663,511184,571,589145,797,00012,981,0002,478,080
5Dec 24, 2023 21:5663,529185,190,632146,836,00011,986,0002,334,720
6Dec 24, 2023 21:5663,554180,511,644147,894,00010,992,0002,482,176
7Dec 24, 2023 21:5663,674182,912,283146,171,00013,015,0002,478,080
8Dec 24, 2023 21:5663,735180,447,999150,319,0009,019,0002,408,448
9Dec 24, 2023 21:5663,803186,127,438143,456,00016,051,0002,473,984
10Dec 24, 2023 21:5665,560229,253,816163,899,20502,191,360
11Dec 24, 2023 21:5665,874227,468,058164,684,30302,199,552
12Dec 24, 2023 21:5665,883223,247,408164,707,83202,191,360