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 21:03Yuriy LyfenkoYuriy LyfenkoScore: 3,944Success
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 21:033,919681,802,496587,804,667016,941,056
2Apr 1, 2023 21:033,921648,943,715588,111,051016,941,056
3Apr 1, 2023 21:033,922641,281,837588,264,293016,936,960
4Apr 1, 2023 21:033,942620,299,718565,339,00025,969,00016,957,440
5Apr 1, 2023 21:033,943612,804,248565,483,00025,976,00017,063,936
6Apr 1, 2023 21:033,944618,246,242565,626,00025,982,00016,957,440
7Apr 1, 2023 21:033,944615,636,293567,630,00023,984,00017,068,032
8Apr 1, 2023 21:033,944613,170,742565,639,00025,983,00017,035,264
9Apr 1, 2023 21:033,944621,286,901564,652,00026,983,00017,072,128
10Apr 1, 2023 21:033,945618,169,702568,696,00022,987,00017,035,264
11Apr 1, 2023 21:033,946613,922,326564,853,00026,992,00017,166,336
12Apr 1, 2023 21:033,946614,956,433563,974,00027,998,00016,986,112