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,921654,731,106588,095,535016,941,056
2Apr 1, 2023 21:033,921650,256,538588,149,198016,945,152
3Apr 1, 2023 21:033,921650,878,798588,210,674016,941,056
4Apr 1, 2023 21:033,943623,042,720566,538,00024,979,00016,957,440
5Apr 1, 2023 21:033,944618,425,938566,563,00024,980,00017,072,128
6Apr 1, 2023 21:033,944614,880,879567,627,00023,984,00017,055,744
7Apr 1, 2023 21:033,944614,260,478565,651,00025,983,00017,125,376
8Apr 1, 2023 21:033,945618,639,057565,691,00025,985,00017,125,376
9Apr 1, 2023 21:033,945613,646,874568,721,00022,988,00017,190,912
10Apr 1, 2023 21:033,945614,611,461565,795,00025,990,00017,096,704
11Apr 1, 2023 21:033,946619,477,258566,898,00024,995,00016,957,440
12Apr 1, 2023 21:033,948612,445,089568,197,00024,008,00017,047,552