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 7, 2024 02:47Huy Duc LeHuy Duc LeScore: 3,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 02:472,947495,986,710442,122,337016,965,632
2Mar 7, 2024 02:472,949500,018,819442,390,433016,965,632
3Mar 7, 2024 02:472,956502,372,594443,389,562016,957,440
4Mar 7, 2024 02:473,000473,234,844420,982,00028,998,00017,117,184
5Mar 7, 2024 02:473,003475,907,223418,433,00031,956,00017,022,976
6Mar 7, 2024 02:473,004479,825,463423,578,00026,973,00017,141,760
7Mar 7, 2024 02:473,007479,195,708423,027,00028,001,00017,178,624
8Mar 7, 2024 02:473,008478,563,928426,213,00025,012,00017,018,880
9Mar 7, 2024 02:473,008478,936,865420,254,00031,018,00017,022,976
10Mar 7, 2024 02:473,010477,451,532413,519,00037,955,00017,170,432
11Mar 7, 2024 02:473,010480,380,569427,555,00023,975,00017,014,784
12Mar 7, 2024 02:473,011475,245,326417,729,00033,978,00017,022,976