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 08:04Huy Duc LeHuy Duc LeScore: 3,156Success
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 08:043,127522,977,779469,009,205016,961,536
2Mar 6, 2024 08:043,132524,176,555469,748,015016,982,016
3Mar 6, 2024 08:043,140539,097,843471,002,644016,969,728
4Mar 6, 2024 08:043,155503,981,176440,210,00033,015,00016,973,824
5Mar 6, 2024 08:043,155499,593,900442,216,00031,015,00016,986,112
6Mar 6, 2024 08:043,155500,077,862449,293,00024,015,00016,982,016
7Mar 6, 2024 08:043,156503,813,211443,454,00029,963,00017,108,992
8Mar 6, 2024 08:043,156500,742,363441,492,00031,963,00017,113,088
9Mar 6, 2024 08:043,157501,398,492441,550,00031,967,00017,190,912
10Mar 6, 2024 08:043,161500,906,205442,191,00032,013,00017,170,432
11Mar 6, 2024 08:043,163506,950,195442,531,00031,966,00016,990,208
12Mar 6, 2024 08:043,165498,212,098442,723,00031,980,00016,994,304