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:02gchebanovgchebanovScore: 3,665Success
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:023,607615,067,061541,058,647016,990,208
2Jul 13, 2023 00:023,609602,343,103541,390,139016,990,208
3Jul 13, 2023 00:023,611600,686,621541,687,457016,982,016
4Jul 13, 2023 00:023,660574,463,253522,998,00025,999,00017,178,624
5Jul 13, 2023 00:023,662578,542,639521,231,00028,012,00017,170,432
6Jul 13, 2023 00:023,663574,106,870519,503,00029,971,00017,137,664
7Jul 13, 2023 00:023,665575,173,312515,727,00033,982,00017,035,264
8Jul 13, 2023 00:023,669578,072,165521,415,00028,967,00017,182,720
9Jul 13, 2023 00:023,672578,049,232518,871,00031,992,00016,957,440
10Jul 13, 2023 00:023,673572,683,245522,936,00027,996,00016,965,632
11Jul 13, 2023 00:023,673576,945,360520,950,00029,997,00016,965,632
12Jul 13, 2023 00:023,678577,246,696520,720,00030,983,00017,149,952