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 27, 2024 11:35IhebIhebScore: 12,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2024 11:3512,6361,932,105,0611,873,487,00021,958,00017,117,184
2Dec 27, 2024 11:3512,6421,923,701,1461,871,280,00024,950,00016,961,536
3Dec 27, 2024 11:3512,6541,928,723,7581,873,110,00024,934,00017,166,336
4Dec 27, 2024 11:3512,6641,927,307,7101,871,704,00027,935,00017,055,744
5Dec 27, 2024 11:3512,6671,931,660,7251,879,081,00020,956,00017,195,008
6Dec 27, 2024 11:3512,6701,931,486,7831,876,560,00023,956,00017,043,456
7Dec 27, 2024 11:3512,7451,940,308,3951,888,828,00022,949,00017,199,104
8Dec 27, 2024 11:3512,7471,943,364,8641,891,097,00020,956,00017,043,456
9Dec 27, 2024 11:3512,7471,940,815,3901,888,109,00023,950,00017,199,104