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 listJul 13, 2023 00:27gchebanovgchebanovScore: 3,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2023 00:273,338553,062,164500,687,392016,961,536
2Jul 13, 2023 00:273,339575,163,509500,840,716016,965,632
3Jul 13, 2023 00:273,343569,160,492501,513,210016,957,440
4Jul 13, 2023 00:273,384530,303,921476,667,00030,978,00017,121,280
5Jul 13, 2023 00:273,388535,176,930482,151,00026,008,00017,117,184
6Jul 13, 2023 00:273,392533,458,850481,870,00026,992,00017,125,376
7Jul 13, 2023 00:273,397538,225,647482,572,00026,976,00017,186,816
8Jul 13, 2023 00:273,401541,580,682482,179,00028,010,00017,113,088
9Jul 13, 2023 00:273,401537,897,970483,195,00027,010,00017,121,280
10Jul 13, 2023 00:273,401534,724,210482,210,00028,012,00016,969,728
11Jul 13, 2023 00:273,403538,853,539482,531,00027,972,00017,039,360
12Jul 13, 2023 00:273,408541,177,346483,177,00028,010,00016,986,112