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 5, 2024 08:43Huy Duc LeHuy Duc LeScore: 4,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2024 08:434,094672,984,615614,137,000016,916,480
2Mar 5, 2024 08:434,099697,097,165614,917,642016,920,576
3Mar 5, 2024 08:434,106693,876,557615,892,710016,900,096
4Mar 5, 2024 08:434,111644,545,951588,636,00027,982,00017,043,456
5Mar 5, 2024 08:434,111638,725,131587,642,00028,982,00017,203,200
6Mar 5, 2024 08:434,112640,692,540587,816,00028,990,00017,145,856
7Mar 5, 2024 08:434,112640,677,969582,849,00033,991,00017,133,568
8Mar 5, 2024 08:434,113639,119,193586,983,00029,999,00017,182,720
9Mar 5, 2024 08:434,118638,888,396593,743,00023,989,00017,043,456
10Mar 5, 2024 08:434,120646,374,545591,036,00027,001,00017,170,432
11Mar 5, 2024 08:434,121646,347,334591,155,00027,007,00017,047,552
12Mar 5, 2024 08:434,124645,304,166582,594,00035,974,00017,043,456