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 listJul 12, 2023 20:17gchebanovgchebanovScore: 4,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 20:174,063637,358,963586,469,00022,979,00017,121,280
2Jul 12, 2023 20:174,069678,985,814610,419,775016,949,248
3Jul 12, 2023 20:174,070635,792,547587,465,00022,979,00016,949,248
4Jul 12, 2023 20:174,070632,485,798586,576,00023,982,00016,973,824
5Jul 12, 2023 20:174,072640,552,117587,740,00022,989,00016,986,112
6Jul 12, 2023 20:174,075636,873,853586,205,00025,008,00017,141,760
7Jul 12, 2023 20:174,076639,014,286585,432,00025,974,00017,027,072
8Jul 12, 2023 20:174,077637,266,395583,492,00028,023,00017,002,496
9Jul 12, 2023 20:174,078678,271,533611,716,185016,949,248
10Jul 12, 2023 20:174,078634,814,720587,694,00023,987,00017,125,376
11Jul 12, 2023 20:174,081676,296,497612,086,408016,949,248
12Jul 12, 2023 20:174,081639,110,607590,121,00022,004,00017,190,912