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:26E SequeiraE SequeiraScore: 4,672Success
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:464,650727,892,149669,462,00027,977,00017,186,816
2Dec 8, 2024 06:464,654721,696,476672,129,00026,004,00017,076,224
3Dec 8, 2024 06:264,661726,387,204674,135,00025,005,00016,982,016
4Dec 8, 2024 06:264,672728,739,429671,870,00028,994,00017,006,592
5Dec 8, 2024 06:264,680741,593,098674,040,00028,001,00017,076,224
6Dec 8, 2024 06:465,066790,589,532740,965,00018,999,00017,039,360