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:50Yuriy LyfenkoYuriy LyfenkoScore: 4,289Success
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:504,155682,148,256623,232,684016,941,056
2Apr 1, 2023 19:504,162688,220,533624,240,294016,932,864
3Apr 1, 2023 19:504,163701,758,759624,522,566016,932,864
4Apr 1, 2023 19:504,264662,917,647611,640,00027,983,00017,002,496
5Apr 1, 2023 19:504,274665,034,406616,076,00024,962,00017,039,360
6Apr 1, 2023 19:504,274667,187,086615,172,00025,965,00016,961,536
7Apr 1, 2023 19:504,289667,261,140618,362,00024,974,00017,039,360
8Apr 1, 2023 19:504,297673,036,969616,570,00027,980,00017,190,912
9Apr 1, 2023 19:504,306673,985,918620,845,00024,993,00017,162,240
10Apr 1, 2023 19:504,314674,508,829620,117,00026,961,00017,178,624
11Apr 1, 2023 19:504,336673,940,674625,417,00024,976,00016,957,440
12Apr 1, 2023 19:504,394684,983,689636,134,00022,968,00016,961,536