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 06:52Huy Duc LeHuy Duc LeScore: 3,272Success
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 06:523,262516,864,839447,401,00041,943,00016,994,304
2Mar 6, 2024 06:523,265513,647,463451,804,00037,983,00016,965,632
3Mar 6, 2024 06:523,268517,520,225442,153,00048,016,00016,994,304
4Mar 6, 2024 06:523,268520,509,174441,158,00049,017,00016,994,304
5Mar 6, 2024 06:523,268524,089,463444,248,00046,025,00017,170,432
6Mar 6, 2024 06:523,270519,953,024444,498,00045,948,00017,195,008
7Mar 6, 2024 06:523,272515,518,902446,878,00043,988,00016,957,440
8Mar 6, 2024 06:523,277513,892,792449,565,00041,959,00017,178,624
9Mar 6, 2024 06:523,278515,888,660441,795,00049,976,00016,982,016
10Mar 6, 2024 06:523,559589,133,847533,784,153016,973,824
11Mar 6, 2024 06:523,567596,519,532535,115,720016,994,304
12Mar 6, 2024 06:523,574592,210,038536,152,442016,982,016