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 listApr 19, 2023 03:14Yuriy LyfenkoYuriy LyfenkoScore: 3,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2023 03:143,925657,165,404588,821,328016,936,960
2Apr 19, 2023 03:143,929656,847,095589,300,089016,932,864
3Apr 19, 2023 03:143,929664,026,700589,417,012016,941,056
4Apr 19, 2023 03:143,942622,665,248565,277,00026,012,00016,957,440
5Apr 19, 2023 03:143,943623,013,175566,373,00025,016,00016,990,208
6Apr 19, 2023 03:143,944613,991,615563,579,00027,979,00016,969,728
7Apr 19, 2023 03:143,944618,424,039563,646,00027,982,00017,154,048
8Apr 19, 2023 03:143,945614,027,638565,772,00025,989,00016,961,536
9Apr 19, 2023 03:143,945615,169,419565,788,00025,990,00016,969,728
10Apr 19, 2023 03:143,946619,436,427565,914,00025,996,00017,092,608
11Apr 19, 2023 03:143,948621,895,188568,237,00024,010,00016,969,728
12Apr 19, 2023 03:143,949622,070,020569,292,00023,011,00017,117,184