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 8, 2024 06:13E SequeiraE SequeiraScore: 6,820Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2024 06:136,7421,046,813,663988,362,00022,985,00017,047,552
2Dec 8, 2024 06:136,7841,051,111,339993,646,00023,991,00017,080,320
3Dec 8, 2024 06:136,7951,042,772,499992,230,00026,979,00016,965,632
4Dec 8, 2024 06:136,8191,052,089,861998,809,00023,995,00017,170,432
5Dec 8, 2024 06:136,8201,048,644,121998,956,00023,998,00016,961,536
6Dec 8, 2024 06:136,8631,060,073,7081,007,454,00021,988,00017,137,664
7Dec 8, 2024 06:136,8931,060,751,1051,008,011,00026,000,00016,961,536
8Dec 8, 2024 06:136,8981,061,824,8711,010,765,00023,994,00017,072,128
9Dec 8, 2024 06:136,9471,075,635,3001,017,018,00025,000,00016,965,632