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 07:20Huy Duc LeHuy Duc LeScore: 3,257Success
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 07:203,241545,973,835486,142,234016,982,016
2Mar 6, 2024 07:203,242554,911,969486,262,126016,986,112
3Mar 6, 2024 07:203,246550,429,031486,935,282016,982,016
4Mar 6, 2024 07:203,250514,200,532443,535,00043,953,00016,986,112
5Mar 6, 2024 07:203,250515,281,854437,570,00049,950,00017,195,008
6Mar 6, 2024 07:203,256521,202,712447,411,00040,946,00017,002,496
7Mar 6, 2024 07:203,257518,787,499448,520,00039,957,00017,092,608
8Mar 6, 2024 07:203,259516,129,432446,859,00041,986,00017,006,592
9Mar 6, 2024 07:203,259517,039,677435,867,00052,983,00016,998,400
10Mar 6, 2024 07:203,263514,597,528441,494,00047,945,00017,063,936
11Mar 6, 2024 07:203,267516,191,630446,033,00044,003,00016,986,112
12Mar 6, 2024 07:203,269520,414,258453,331,00036,945,00017,154,048