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:27Yuriy LyfenkoYuriy LyfenkoScore: 4,026Success
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:273,964660,300,529594,592,228016,900,096
2Apr 22, 2023 18:273,967658,171,289595,100,544016,920,576
3Apr 22, 2023 18:273,969684,604,347595,418,977016,908,288
4Apr 22, 2023 18:274,018631,619,005576,750,00025,988,00017,047,552
5Apr 22, 2023 18:274,023632,690,360575,490,00027,975,00017,002,496
6Apr 22, 2023 18:274,025627,867,476576,692,00026,985,00016,953,344
7Apr 22, 2023 18:274,026631,622,424577,848,00025,993,00017,141,760
8Apr 22, 2023 18:274,028629,583,892578,155,00026,007,00017,195,008
9Apr 22, 2023 18:274,030627,600,300580,576,00023,982,00017,031,168
10Apr 22, 2023 18:274,034630,353,318580,025,00025,001,00016,977,920
11Apr 22, 2023 18:274,034627,880,145580,166,00025,007,00016,945,152
12Apr 22, 2023 18:274,035631,482,933579,195,00026,008,00017,047,552