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 16, 2024 23:57Mikhail ShirokovMikhail ShirokovScore: 16,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 16, 2024 23:5716,2622,470,476,3172,419,266,00019,985,00016,945,152
2Dec 16, 2024 23:5716,3322,480,863,2752,431,848,00017,991,00016,969,728
3Dec 16, 2024 23:5716,3432,478,600,2602,436,476,00014,990,00017,043,456
4Dec 16, 2024 23:5716,3512,478,775,9712,433,587,00018,988,00017,039,360
5Dec 16, 2024 23:5716,3702,483,067,6732,434,467,00020,986,00016,953,344
6Dec 16, 2024 23:5716,3812,486,684,3292,433,181,00023,991,00017,117,184
7Dec 16, 2024 23:5716,3972,484,689,8522,433,545,00025,984,00016,977,920
8Dec 16, 2024 23:5716,4172,489,087,6442,435,585,00026,984,00017,108,992
9Dec 16, 2024 23:5719,3972,934,941,8402,889,519,00019,989,00017,108,992