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:27Alexander MonakovAlexander MonakovScore: 4,042Success
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:274,024662,097,472603,592,773017,006,592
2Mar 26, 2023 11:274,035689,178,582605,256,243017,002,496
3Mar 26, 2023 11:274,036672,036,603605,448,485016,945,152
4Mar 26, 2023 11:274,040629,308,591591,945,00013,998,00016,977,920
5Mar 26, 2023 11:274,041630,347,502590,205,00016,005,00017,162,240
6Mar 26, 2023 11:274,041627,285,915588,210,00018,006,00017,133,568
7Mar 26, 2023 11:274,042627,958,347589,241,00017,006,00017,092,608
8Mar 26, 2023 11:274,043630,434,694593,502,00012,989,00017,006,592
9Mar 26, 2023 11:274,044632,854,337582,623,00023,984,00017,088,512
10Mar 26, 2023 11:274,045631,950,128585,798,00020,992,00016,957,440
11Mar 26, 2023 11:274,047629,074,627591,988,00014,999,00017,108,992
12Mar 26, 2023 11:274,048633,609,065594,209,00013,004,00017,092,608