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:59Yuriy LyfenkoYuriy LyfenkoScore: 4,180Success
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:594,121685,937,495618,171,926016,949,248
2Apr 1, 2023 19:594,125696,922,444618,730,210016,936,960
3Apr 1, 2023 19:594,125694,121,211618,815,014016,941,056
4Apr 1, 2023 19:594,154650,178,076599,123,00023,964,00016,957,440
5Apr 1, 2023 19:594,163647,454,096600,427,00023,977,00016,949,248
6Apr 1, 2023 19:594,174650,034,853603,155,00022,967,00017,014,784
7Apr 1, 2023 19:594,180650,490,436600,035,00026,956,00016,961,536
8Apr 1, 2023 19:594,192658,188,075604,848,00023,954,00017,039,360
9Apr 1, 2023 19:594,192660,891,436603,912,00024,955,00017,121,280
10Apr 1, 2023 19:594,200657,595,079604,078,00025,960,00016,965,632
11Apr 1, 2023 19:594,248658,512,303615,256,00021,973,00017,084,416
12Apr 1, 2023 19:594,252670,073,679611,828,00025,950,00016,961,536