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 01:43Joad NacerJoad NacerScore: 4,226Success
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 01:434,220653,792,195592,980,00039,998,00017,051,648
2Dec 27, 2024 01:434,221654,247,625595,131,00038,008,00017,051,648
3Dec 27, 2024 01:434,224659,343,254592,600,00040,972,00017,043,456
4Dec 27, 2024 01:434,225655,696,835585,736,00047,978,00017,047,552
5Dec 27, 2024 01:434,226650,287,082588,927,00044,994,00016,977,920
6Dec 27, 2024 01:434,228660,680,804594,151,00040,010,00017,047,552
7Dec 27, 2024 01:434,229666,975,974591,404,00042,956,00017,190,912
8Dec 27, 2024 01:434,229657,864,958590,432,00043,957,00017,215,488
9Dec 27, 2024 01:434,231657,537,963591,647,00042,974,00016,953,344