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 listJan 17, 2025 20:25Ian MckibbenIan MckibbenScore: 19,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2025 20:2519,1952,904,353,1992,856,299,00022,962,00016,973,824
2Jan 17, 2025 20:2519,4022,942,582,0092,885,413,00024,951,00017,108,992
3Jan 17, 2025 20:2519,4762,954,091,7292,896,441,00024,952,00017,166,336
4Jan 17, 2025 20:2519,6292,977,602,0302,918,415,00025,950,00016,965,632
5Jan 17, 2025 20:2519,8523,012,388,5412,949,885,00027,951,00016,965,632
6Jan 17, 2025 20:2520,0583,041,031,4152,983,812,00024,956,00017,108,992
7Jan 17, 2025 20:2520,0593,036,935,4702,983,954,00024,957,00016,965,632
8Jan 17, 2025 20:2520,1303,052,167,0292,993,579,00025,953,00017,121,280
9Jan 17, 2025 20:2520,2183,062,348,0813,005,750,00026,952,00017,084,416