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 listMay 31, 2025 15:11KeefeKeefeScore: 4,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2025 15:114,050631,640,533598,503,0008,992,00017,027,072
2May 31, 2025 15:114,050633,954,420598,574,0008,993,00017,031,168
3May 31, 2025 15:114,051637,419,454598,577,0009,008,00017,178,624
4May 31, 2025 15:114,053632,698,751598,994,0008,999,00017,027,072
5May 31, 2025 15:114,057632,373,405598,547,0009,992,00017,149,952
6May 31, 2025 15:114,058640,087,798598,709,0009,995,00016,953,344
7May 31, 2025 15:114,059634,845,486598,926,0009,998,00016,945,152
8May 31, 2025 15:114,061640,608,178600,122,0009,001,00016,941,056
9May 31, 2025 15:114,064635,687,430599,610,0009,993,00017,031,168