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 listDec 12, 2024 18:57Yuriy LyfenkoYuriy LyfenkoScore: 3,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2024 18:563,938612,380,552562,656,00027,982,00017,043,456
2Dec 12, 2024 18:563,938617,831,557565,764,00024,989,00017,100,800
3Dec 12, 2024 18:563,939615,893,703566,893,00023,995,00017,006,592
4Dec 12, 2024 18:563,940614,151,641564,062,00027,003,00017,080,320
5Dec 12, 2024 18:563,941612,410,222567,091,00024,003,00017,076,224
6Dec 12, 2024 18:573,941613,122,241563,108,00028,005,00016,949,248
7Dec 12, 2024 18:573,942624,622,337569,310,00022,012,00016,965,632
8Dec 12, 2024 18:563,943616,354,348562,478,00028,973,00017,117,184
9Dec 12, 2024 18:563,943617,593,403564,507,00026,976,00017,113,088
10Dec 12, 2024 18:563,943615,127,682564,535,00026,977,00016,957,440
11Dec 12, 2024 18:573,943619,197,849568,458,00022,978,00017,006,592
12Dec 12, 2024 18:563,944613,996,055565,633,00025,983,00016,965,632