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 18, 2026 11:16Charles CabergsCharles CabergsScore: 4,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 11:164,493699,282,838651,015,00023,000,00017,059,840
2Apr 18, 2026 11:164,504704,470,557651,646,00023,986,00017,039,360
3Apr 18, 2026 11:164,584710,742,275660,568,00026,982,00016,961,536
4Apr 18, 2026 11:164,601719,651,156660,164,00030,007,00016,949,248
5Apr 18, 2026 11:164,616721,000,887667,410,00024,977,00016,953,344
6Apr 18, 2026 11:164,617721,281,023668,609,00023,986,00016,953,344
7Apr 18, 2026 11:164,618715,490,093667,642,00024,986,00016,969,728
8Apr 18, 2026 11:164,619717,110,862668,823,00023,993,00017,186,816
9Apr 18, 2026 11:164,659722,726,360673,916,00024,996,00016,961,536