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 listAug 31, 2024 10:50Andrey LikhachevAndrey LikhachevScore: 4,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2024 10:504,242668,458,429624,334,00011,987,00016,424,960
2Aug 31, 2024 10:504,246664,384,571627,946,0008,984,00016,416,768
3Aug 31, 2024 10:504,249665,982,104626,422,00010,989,00016,412,672
4Aug 31, 2024 10:504,256668,087,555625,505,00012,969,00016,261,120
5Aug 31, 2024 10:504,274668,531,004633,141,0007,989,00016,412,672
6Aug 31, 2024 10:504,361684,427,139642,207,00011,985,00016,404,480
7Aug 31, 2024 10:504,367686,490,168645,019,0009,984,00016,191,488
8Aug 31, 2024 10:504,368685,320,325646,154,0008,988,00016,175,104
9Aug 31, 2024 10:504,370688,532,136643,463,00011,971,00016,384,000
10Aug 31, 2024 10:504,372686,165,610650,819,0004,990,00016,420,864
11Aug 31, 2024 10:504,398693,483,990649,694,0009,979,00016,420,864
12Aug 31, 2024 10:5010,0901,545,020,6561,505,484,0007,991,00016,171,008