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 09:54M-RochatM-RochatScore: 19,483Success
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 09:5618,8702,842,380,9462,803,128,00027,380,00016,793,600
2May 17, 2026 09:5618,9112,848,572,1392,809,363,00027,408,00016,793,600
3May 17, 2026 09:5618,9262,848,241,7702,811,590,00027,410,00016,793,600
4May 17, 2026 09:5618,9352,849,366,7612,813,034,00027,222,00016,793,600
5May 17, 2026 09:5619,4832,932,749,8042,895,202,00027,278,00016,793,600
6May 17, 2026 09:5619,6112,950,608,8692,913,862,00027,888,00016,793,600
7May 17, 2026 09:5624,7083,718,597,7103,680,469,00025,874,00016,793,600
8May 17, 2026 09:5625,4063,822,056,9063,784,793,00026,186,00016,793,600
9May 17, 2026 09:5625,8223,883,396,9643,847,562,00025,795,00016,793,600