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 05:01Yuriy LyfenkoYuriy LyfenkoScore: 4,432Success
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 05:014,254724,950,262638,090,924016,936,960
2Apr 1, 2023 05:014,256714,430,580638,419,127016,941,056
3Apr 1, 2023 05:014,263697,143,457639,385,747016,945,152
4Apr 1, 2023 05:014,309671,503,463619,428,00026,975,00017,031,168
5Apr 1, 2023 05:014,351678,668,928627,615,00024,984,00017,051,648
6Apr 1, 2023 05:014,374679,035,187632,126,00023,966,00017,178,624
7Apr 1, 2023 05:014,432689,968,399641,746,00022,990,00017,137,664
8Apr 1, 2023 05:014,436689,267,153640,382,00024,975,00016,969,728
9Apr 1, 2023 05:014,458697,593,225644,778,00023,991,00016,949,248
10Apr 1, 2023 05:014,464700,539,660643,650,00025,985,00017,039,360
11Apr 1, 2023 05:014,465695,446,793645,730,00023,989,00016,961,536
12Apr 1, 2023 05:014,468696,300,958647,181,00022,970,00016,973,824