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 listMar 26, 2023 11:55Alexander MonakovAlexander MonakovScore: 3,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 11:553,925646,382,200588,762,074016,990,208
2Mar 26, 2023 11:553,935613,135,596585,283,0005,002,00017,080,320
3Mar 26, 2023 11:553,935617,996,731582,305,0008,004,00017,076,224
4Mar 26, 2023 11:553,936621,114,310583,365,0007,004,00016,957,440
5Mar 26, 2023 11:553,936620,925,771583,380,0007,004,00017,080,320
6Mar 26, 2023 11:553,937653,152,777590,489,813016,982,016
7Mar 26, 2023 11:553,937648,320,347590,557,875016,986,112
8Mar 26, 2023 11:553,937620,926,166585,557,0004,996,00016,998,400
9Mar 26, 2023 11:553,937612,339,059582,561,0007,993,00017,076,224
10Mar 26, 2023 11:553,937614,010,937580,564,0009,992,00017,080,320
11Mar 26, 2023 11:553,937613,081,567584,567,0005,995,00016,986,112
12Mar 26, 2023 11:553,938613,757,499583,702,0006,996,00017,190,912