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 1, 2023 19:32Yuriy LyfenkoYuriy LyfenkoScore: 4,198Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2023 19:324,138691,899,048620,637,217016,936,960
2Apr 1, 2023 19:324,140695,299,035621,073,128016,936,960
3Apr 1, 2023 19:324,146695,487,922621,848,441016,941,056
4Apr 1, 2023 19:324,182653,643,118602,363,00024,973,00017,129,472
5Apr 1, 2023 19:324,184651,886,446602,569,00024,982,00017,190,912
6Apr 1, 2023 19:324,194655,511,726602,102,00026,959,00017,162,240
7Apr 1, 2023 19:324,198653,203,488600,690,00028,985,00017,117,184
8Apr 1, 2023 19:324,200658,390,509607,966,00021,962,00016,961,536
9Apr 1, 2023 19:324,201653,605,701604,150,00025,963,00016,961,536
10Apr 1, 2023 19:324,201656,070,431605,152,00024,965,00016,969,728
11Apr 1, 2023 19:324,213665,243,647609,030,00022,963,00016,961,536
12Apr 1, 2023 19:324,215654,241,731606,246,00025,967,00017,080,320