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 22, 2023 18:32Yuriy LyfenkoYuriy LyfenkoScore: 4,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2023 18:323,948656,619,203592,187,767016,928,768
2Apr 22, 2023 18:323,949653,097,314592,299,342016,928,768
3Apr 22, 2023 18:323,952656,570,622592,769,303016,924,672
4Apr 22, 2023 18:324,002625,480,837577,309,00023,012,00016,945,152
5Apr 22, 2023 18:324,004627,338,614575,615,00024,983,00017,195,008
6Apr 22, 2023 18:324,005622,604,252575,707,00024,987,00017,068,032
7Apr 22, 2023 18:324,005625,689,403574,805,00025,991,00017,207,296
8Apr 22, 2023 18:324,008623,291,624576,176,00025,007,00017,047,552
9Apr 22, 2023 18:324,008629,823,680573,223,00028,010,00017,051,648
10Apr 22, 2023 18:324,008627,620,332577,245,00024,010,00017,125,376
11Apr 22, 2023 18:324,013625,155,287577,895,00023,995,00017,203,200
12Apr 22, 2023 18:324,018620,305,433575,719,00026,986,00016,945,152