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 07:02Huy Duc LeHuy Duc LeScore: 3,223Success
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 07:023,188534,108,246478,229,715016,998,400
2Mar 6, 2024 07:023,193534,904,024478,900,284016,990,208
3Mar 6, 2024 07:023,206536,717,230480,952,441016,994,304
4Mar 6, 2024 07:023,220510,384,796435,949,00046,994,00017,006,592
5Mar 6, 2024 07:023,221509,669,626438,143,00045,014,00017,018,880
6Mar 6, 2024 07:023,222510,317,683435,436,00047,937,00017,166,336
7Mar 6, 2024 07:023,223509,083,660433,573,00049,950,00017,133,568
8Mar 6, 2024 07:023,224508,933,805435,632,00047,959,00017,096,704
9Mar 6, 2024 07:023,224511,929,216437,667,00045,965,00016,994,304
10Mar 6, 2024 07:023,227510,445,854438,038,00046,004,00017,129,472
11Mar 6, 2024 07:023,228504,834,517440,141,00044,014,00017,113,088
12Mar 6, 2024 07:023,236513,074,410434,530,00050,944,00017,125,376