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 listNov 20, 2023 17:35Yuriy LyfenkoYuriy LyfenkoScore: 55,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2023 17:3554,889167,164,962128,209,0009,014,0002,461,696
2Nov 20, 2023 17:3554,932162,648,300126,303,00011,026,0002,416,640
3Nov 20, 2023 17:3554,935162,881,481125,309,00012,029,0002,285,568
4Nov 20, 2023 17:3554,972164,229,443125,392,00012,037,0002,355,200
5Nov 20, 2023 17:3555,002168,115,197126,466,00011,040,0002,498,560
6Nov 20, 2023 17:3555,127162,754,563127,832,0009,986,0002,281,472
7Nov 20, 2023 17:3555,135168,616,129128,848,0008,989,0002,285,568
8Nov 20, 2023 17:3555,222164,846,996124,049,00014,005,0002,281,472
9Nov 20, 2023 17:3555,319168,482,768129,279,0009,019,0002,273,280
10Nov 20, 2023 17:3557,798220,909,968144,494,51902,277,376
11Nov 20, 2023 17:3557,812210,786,205144,530,17202,277,376
12Nov 20, 2023 17:3558,018203,617,436145,044,12902,265,088