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 listMay 10, 2024 15:31Joad NacerJoad NacerScore: 4,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2024 15:314,309703,294,657646,332,119016,924,672
2May 10, 2024 15:314,312705,847,194646,735,907016,928,768
3May 10, 2024 15:314,315714,441,303647,290,822016,920,576
4May 10, 2024 15:314,346675,223,479607,914,00043,993,00017,014,784
5May 10, 2024 15:314,348679,380,888606,136,00046,010,00017,154,048
6May 10, 2024 15:314,348677,329,902607,228,00045,016,00017,137,664
7May 10, 2024 15:314,349678,423,557609,388,00042,956,00017,145,856
8May 10, 2024 15:314,352681,958,665609,787,00042,985,00017,162,240
9May 10, 2024 15:314,353676,465,448607,998,00044,999,00017,137,664
10May 10, 2024 15:314,354681,863,432603,111,00050,009,00017,072,128
11May 10, 2024 15:314,355679,351,247607,332,00045,949,00017,154,048
12May 10, 2024 15:314,356683,160,845610,501,00042,964,00016,990,208