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 listApr 22, 2023 22:24Yuriy LyfenkoYuriy LyfenkoScore: 3,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2023 22:243,924663,668,614588,671,691016,928,768
2Apr 22, 2023 22:243,927661,557,345588,986,571016,924,672
3Apr 22, 2023 22:243,927650,845,212589,009,788016,924,672
4Apr 22, 2023 22:243,952614,825,334562,837,00029,991,00017,195,008
5Apr 22, 2023 22:243,954623,393,109567,066,00026,003,00017,195,008
6Apr 22, 2023 22:243,954616,995,515568,090,00025,003,00017,203,200
7Apr 22, 2023 22:243,954620,960,915567,103,00026,004,00017,195,008
8Apr 22, 2023 22:243,954614,418,281567,129,00026,005,00016,953,344
9Apr 22, 2023 22:243,955621,754,966567,245,00026,011,00017,158,144
10Apr 22, 2023 22:243,957625,192,297568,547,00024,980,00017,154,048
11Apr 22, 2023 22:243,957618,536,124570,569,00022,982,00017,203,200
12Apr 22, 2023 22:243,957618,294,263567,592,00025,981,00017,117,184