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 6, 2024 16:17Huy Duc LeHuy Duc LeScore: 3,050Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2024 16:173,001516,528,775450,111,498016,965,632
2Mar 6, 2024 16:173,002514,845,043450,358,996016,957,440
3Mar 6, 2024 16:173,011515,325,905451,658,233016,973,824
4Mar 6, 2024 16:173,047478,271,096425,988,00030,999,00017,195,008
5Mar 6, 2024 16:173,047483,507,658420,099,00037,008,00017,010,688
6Mar 6, 2024 16:173,048484,417,369424,219,00033,017,00017,018,880
7Mar 6, 2024 16:173,050487,547,743427,543,00029,967,00017,149,952
8Mar 6, 2024 16:173,051483,346,773431,718,00025,983,00016,998,400
9Mar 6, 2024 16:173,052483,648,690419,857,00037,987,00017,031,168
10Mar 6, 2024 16:173,055491,811,894433,298,00025,017,00016,986,112
11Mar 6, 2024 16:173,056485,224,004431,503,00026,968,00017,104,896
12Mar 6, 2024 16:173,060481,472,194434,969,00023,998,00017,063,936