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 15:15Yuriy LyfenkoYuriy LyfenkoScore: 3,960Success
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 15:153,927666,092,809589,020,599016,920,576
2Apr 22, 2023 15:153,929656,362,908589,324,043016,932,864
3Apr 22, 2023 15:153,930656,382,619589,461,961016,920,576
4Apr 22, 2023 15:153,958614,566,967568,647,00024,984,00017,207,296
5Apr 22, 2023 15:153,959620,463,339569,861,00023,994,00017,018,880
6Apr 22, 2023 15:153,960620,306,492570,996,00022,999,00017,203,200
7Apr 22, 2023 15:153,960617,334,938569,019,00025,000,00017,068,032
8Apr 22, 2023 15:153,962624,979,691570,330,00024,013,00016,990,208
9Apr 22, 2023 15:153,964623,219,253566,565,00027,978,00016,945,152
10Apr 22, 2023 15:153,966617,703,931569,917,00024,996,00016,945,152
11Apr 22, 2023 15:153,968624,043,199571,160,00024,006,00016,949,248
12Apr 22, 2023 15:153,991631,292,109570,601,00027,980,00016,949,248