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 listDec 28, 2024 01:19Joad NacerJoad NacerScore: 4,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 01:194,187652,569,039582,109,00046,008,00017,051,648
2Dec 28, 2024 01:194,188653,084,951586,199,00042,014,00017,174,528
3Dec 28, 2024 01:194,188654,754,301583,201,00045,015,00016,982,016
4Dec 28, 2024 01:194,190659,490,951588,521,00039,967,00016,957,440
5Dec 28, 2024 01:194,190658,210,838586,586,00041,970,00017,051,648
6Dec 28, 2024 01:194,191651,640,692582,733,00045,978,00016,990,208
7Dec 28, 2024 01:194,192651,015,904589,745,00038,983,00017,043,456
8Dec 28, 2024 01:194,199659,578,858584,914,00044,993,00017,035,264
9Dec 28, 2024 01:194,274667,402,289596,141,00044,935,00017,047,552