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 listMay 5, 2026 22:26olliecrowolliecrowScore: 3,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 22:273,159492,723,858469,728,0004,188,00017,174,528
2May 5, 2026 22:273,162491,765,247470,077,0004,237,00017,166,336
3May 5, 2026 22:273,162493,607,866469,974,0004,454,00017,166,336
4May 5, 2026 22:273,165491,765,475470,369,0004,499,00017,162,240
5May 5, 2026 22:273,165493,271,074470,291,0004,522,00017,162,240
6May 5, 2026 22:273,166492,133,884470,736,0004,270,00017,166,336
7May 5, 2026 22:273,168492,055,761470,574,0004,645,00017,014,784
8May 5, 2026 22:273,170495,183,248471,480,0004,112,00017,170,432
9May 5, 2026 22:273,171494,477,849471,474,0004,260,00017,178,624