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 24, 2023 19:30Bernard TeoBernard TeoScore: 11,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2023 19:3311,6161,807,361,5981,742,353,335016,928,768
2Mar 24, 2023 19:3311,6431,798,084,7301,746,435,299016,932,864
3Mar 24, 2023 19:3311,7041,821,427,4821,755,578,779016,924,672
4Mar 24, 2023 19:3011,7591,837,919,2031,763,795,534016,928,768
5Mar 24, 2023 19:3011,7671,840,932,7611,765,076,320016,928,768
6Mar 24, 2023 19:3011,8801,856,715,5981,781,968,431016,924,672