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:17Joad NacerJoad NacerScore: 4,188Success
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:174,181653,807,552584,174,00043,012,00016,990,208
2Dec 28, 2024 01:174,184649,622,671583,688,00043,976,00017,104,896
3Dec 28, 2024 01:174,187649,104,231592,045,00036,002,00017,137,664
4Dec 28, 2024 01:174,187651,212,609582,110,00046,008,00017,154,048
5Dec 28, 2024 01:174,188654,643,775585,195,00043,014,00017,051,648
6Dec 28, 2024 01:174,189655,602,835582,273,00046,021,00017,162,240
7Dec 28, 2024 01:174,190662,453,911587,511,00040,965,00017,084,416
8Dec 28, 2024 01:174,190651,588,382587,597,00040,971,00017,158,144
9Dec 28, 2024 01:174,195652,170,772590,227,00039,015,00017,137,664