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 listNov 1, 2025 02:13Huy Duc LeHuy Duc LeScore: 2,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2025 15:222,969476,376,614415,420,00029,958,00016,998,400
2Nov 1, 2025 02:132,973469,131,210419,960,00025,997,00017,117,184
3Oct 31, 2025 15:362,974473,795,029418,129,00028,008,00017,059,840
4Oct 31, 2025 15:362,975478,667,275419,242,00027,015,00017,170,432
5Oct 31, 2025 15:222,976471,428,680414,375,00031,951,00017,104,896
6Oct 31, 2025 15:362,977472,342,626416,526,00029,965,00016,982,016
7Nov 1, 2025 02:132,977472,428,367417,626,00028,974,00016,990,208
8Oct 31, 2025 15:362,979468,901,641412,921,00033,993,00016,973,824
9Oct 31, 2025 15:362,980470,233,352419,001,00028,000,00017,162,240
10Nov 1, 2025 02:132,980467,739,206419,973,00026,998,00016,994,304
11Nov 1, 2025 02:132,983469,454,170417,555,00029,968,00017,100,800
12Nov 1, 2025 02:132,984475,097,542422,649,00024,979,00016,990,208
13Oct 31, 2025 15:362,984470,786,054413,579,00033,965,00017,002,496
14Oct 31, 2025 15:362,984470,881,616415,583,00031,967,00016,982,016
15Oct 31, 2025 15:362,985472,151,701417,792,00029,985,00017,072,128
16Nov 1, 2025 02:132,987470,295,883420,024,00028,001,00017,035,264
17Oct 31, 2025 15:222,993471,112,645416,924,00031,994,00016,977,920
18Nov 1, 2025 02:132,995477,647,168425,225,00024,012,00016,998,400
19Nov 1, 2025 02:132,995474,637,180423,251,00026,015,00016,977,920
20Nov 1, 2025 02:132,998475,053,797424,736,00024,984,00017,096,704
21Oct 31, 2025 15:363,056487,220,071428,421,00029,959,00016,982,016