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 21, 2023 04:10Yuriy LyfenkoYuriy LyfenkoScore: 4,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2023 04:104,294710,512,889644,160,275016,957,440
2Mar 21, 2023 04:104,321708,078,163648,110,945016,953,344
3Mar 21, 2023 04:104,338714,451,939650,727,743016,949,248
4Mar 21, 2023 04:104,393684,981,899634,030,00024,961,00016,957,440
5Mar 21, 2023 04:104,404687,189,818635,723,00024,949,00016,982,016
6Mar 21, 2023 04:104,461689,346,469646,244,00022,973,00016,998,400
7Mar 21, 2023 04:104,468691,751,045643,237,00026,968,00017,170,432
8Mar 21, 2023 04:104,555711,875,539659,210,00023,971,00016,957,440
9Mar 21, 2023 04:104,566715,470,831662,879,00021,995,00016,969,728
10Mar 21, 2023 04:104,581712,125,707661,244,00025,970,00016,953,344
11Mar 21, 2023 04:104,621721,178,588667,249,00025,970,00017,182,720
12Mar 21, 2023 04:104,679727,479,278678,847,00022,994,00017,203,200