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 22, 2023 18:12Yuriy LyfenkoYuriy LyfenkoScore: 4,006Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2023 18:123,951669,131,393592,620,791016,924,672
2Apr 22, 2023 18:123,951647,482,693592,695,655016,928,768
3Apr 22, 2023 18:123,954661,858,661593,081,335016,920,576
4Apr 22, 2023 18:124,004626,897,374575,552,00024,980,00017,207,296
5Apr 22, 2023 18:124,004622,735,321575,602,00024,982,00017,051,648
6Apr 22, 2023 18:124,006620,054,438576,892,00023,995,00017,068,032
7Apr 22, 2023 18:124,006629,691,171574,921,00025,996,00016,957,440
8Apr 22, 2023 18:124,008624,264,756574,190,00027,008,00016,969,728
9Apr 22, 2023 18:124,009629,447,038576,312,00025,013,00016,949,248
10Apr 22, 2023 18:124,012625,659,634577,847,00023,993,00016,949,248
11Apr 22, 2023 18:124,012630,117,700566,868,00034,991,00016,982,016
12Apr 22, 2023 18:124,014629,501,966577,059,00025,002,00017,068,032