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 6, 2024 16:12Huy Duc LeHuy Duc LeScore: 3,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2024 16:123,041480,124,684428,140,00028,009,00017,096,704
2Mar 6, 2024 16:123,043483,009,113424,478,00031,960,00017,190,912
3Mar 6, 2024 16:123,044479,647,971423,562,00032,965,00017,203,200
4Mar 6, 2024 16:123,047479,082,194428,044,00029,003,00017,018,880
5Mar 6, 2024 16:123,048482,504,842424,208,00033,016,00017,195,008
6Mar 6, 2024 16:123,052482,215,958428,849,00028,989,00017,051,648
7Mar 6, 2024 16:123,056490,582,715418,315,00040,030,00017,174,528
8Mar 6, 2024 16:123,057484,815,253434,617,00023,978,00017,158,144
9Mar 6, 2024 16:123,068485,236,765430,177,00030,012,00016,986,112
10Mar 6, 2024 16:123,217544,565,193482,563,719016,957,440
11Mar 6, 2024 16:123,223545,403,463483,395,107016,961,536
12Mar 6, 2024 16:123,226538,882,893483,935,779016,941,056