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 23:40Yurkov AlekseyYurkov AlekseyScore: 4,124Success
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 23:404,117642,674,073606,517,00010,991,00017,158,144
2Mar 24, 2023 23:404,118646,157,199605,764,00011,995,00017,104,896
3Mar 24, 2023 23:404,119639,975,562605,914,00011,998,00017,121,280
4Mar 24, 2023 23:404,121646,844,890605,216,00013,004,00017,117,184
5Mar 24, 2023 23:404,122649,696,045607,331,00010,987,00017,149,952
6Mar 24, 2023 23:404,122646,715,767604,379,00013,985,00016,973,824
7Mar 24, 2023 23:404,124646,497,822608,623,0009,993,00016,973,824
8Mar 24, 2023 23:404,125678,496,564618,704,882016,949,248
9Mar 24, 2023 23:404,125645,928,598603,760,00014,994,00016,973,824
10Mar 24, 2023 23:404,128648,052,052609,195,00010,003,00017,145,856
11Mar 24, 2023 23:404,129684,669,609619,345,380016,932,864
12Mar 24, 2023 23:404,146679,206,050621,959,644016,932,864