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 17, 2026 23:10M-RochatM-RochatScore: 20,924Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 23:1120,6733,110,331,0133,076,786,00024,203,00016,793,600
2May 17, 2026 23:1120,8123,131,971,0443,095,678,00026,204,00016,793,600
3May 17, 2026 23:1120,8373,137,195,4503,099,428,00026,177,00016,793,600
4May 17, 2026 23:1120,8613,139,680,6863,104,738,00024,415,00016,793,600
5May 17, 2026 23:1120,9243,149,457,8603,113,065,00025,593,00016,793,600
6May 17, 2026 23:1120,9793,157,996,0663,122,305,00024,560,00016,793,600
7May 17, 2026 23:1120,9923,159,702,9433,124,174,00024,682,00016,793,600
8May 17, 2026 23:1121,0393,167,506,8993,131,584,00024,352,00016,793,600
9May 17, 2026 23:1121,1293,178,823,1783,144,976,00024,490,00016,793,600