Large matrix multiplication Liam

Multiply two square matrices as fast as possible.

Input

Two 2000 x 2000 matrices of uint32 values on STDIN, encoded back-to-back in row-major order, little-endian byte order.

Output

Write the resulting 2000 x 2000 product matrix to STDOUT in the same binary format (row-major, little-endian uint32).

Back to listMar 24, 2023 16:19Yuriy LyfenkoYuriy LyfenkoScore: 4,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2023 16:194,382718,939,995657,247,884016,953,344
2Mar 24, 2023 16:194,383714,073,471657,383,854016,953,344
3Mar 24, 2023 16:194,385721,397,901657,772,010016,953,344
4Mar 24, 2023 16:194,448690,792,296642,260,00024,971,00017,145,856
5Mar 24, 2023 16:194,452697,439,807645,735,00021,991,00017,166,336
6Mar 24, 2023 16:194,453693,316,543642,960,00024,959,00016,957,440
7Mar 24, 2023 16:194,456691,964,265644,370,00023,976,00016,977,920
8Mar 24, 2023 16:194,480706,486,342646,030,00025,961,00017,162,240
9Mar 24, 2023 16:194,480696,539,180644,050,00027,958,00017,121,280
10Mar 24, 2023 16:194,481701,422,423646,150,00025,965,00016,965,632
11Mar 24, 2023 16:194,486700,638,213648,974,00023,962,00017,084,416
12Mar 24, 2023 16:194,494702,783,295651,097,00022,968,00016,965,632