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 06:09olliecrowolliecrowScore: 3,168Success
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 06:103,162491,309,986470,116,0004,200,00017,158,144
2May 5, 2026 06:103,162492,201,058470,251,0004,116,00017,158,144
3May 5, 2026 06:103,162492,495,781470,218,0004,220,00017,158,144
4May 5, 2026 06:103,163494,097,837470,271,0004,240,00017,158,144
5May 5, 2026 06:103,168494,490,917470,783,0004,474,00017,158,144
6May 5, 2026 06:103,170494,539,491471,050,0004,486,00017,166,336
7May 5, 2026 06:103,171492,770,531471,551,0004,236,00017,170,432
8May 5, 2026 06:103,171495,948,528471,166,0004,513,00017,162,240
9May 5, 2026 06:103,178495,127,078472,277,0004,502,00017,170,432