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 listJun 24, 2026 10:30anboto1anboto1Score: 6,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:316,178935,990,399901,544,00025,217,00016,793,600
2Jun 24, 2026 10:316,7441,020,887,455987,201,00024,479,00016,793,600
3Jun 24, 2026 10:316,9181,046,921,9201,012,827,00024,901,00016,793,600
4Jun 24, 2026 10:316,9231,047,775,0331,014,134,00024,335,00016,793,600
5Jun 24, 2026 10:316,9431,050,693,8461,015,128,00026,368,00016,793,600
6Jun 24, 2026 10:316,9431,050,762,9541,016,385,00025,175,00016,793,600
7Jun 24, 2026 10:316,9431,050,981,5431,015,845,00025,628,00016,793,600
8Jun 24, 2026 10:316,9771,055,759,3511,021,982,00024,625,00016,793,600
9Jun 24, 2026 10:316,9981,059,047,1571,024,888,00024,884,00016,793,600