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 07:35olliecrowolliecrowScore: 3,163Success
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 07:363,157492,903,346469,439,0004,239,00017,162,240
2May 5, 2026 07:363,158491,849,365469,542,0004,189,00017,162,240
3May 5, 2026 07:363,158490,930,179469,506,0004,209,00017,166,336
4May 5, 2026 07:363,163493,642,097470,060,0004,457,00017,174,528
5May 5, 2026 07:363,163490,559,760470,251,0004,254,00017,178,624
6May 5, 2026 07:363,164491,514,694470,259,0004,461,00017,170,432
7May 5, 2026 07:363,165493,905,225470,513,0004,237,00017,162,240
8May 5, 2026 07:363,166493,510,342470,792,0004,222,00017,170,432
9May 5, 2026 07:363,166492,409,960470,447,0004,519,00017,178,624