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 listNov 4, 2026 03:05Andrew EpsteinAndrew EpsteinScore: 1,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 03:071,541240,363,324227,006,0004,201,00016,793,600
2Nov 4, 2026 03:071,541240,336,324227,007,0004,164,00016,793,600
3Nov 4, 2026 03:071,542240,392,675227,062,0004,326,00016,793,600
4Nov 4, 2026 03:071,543240,633,260227,339,0004,157,00016,793,600
5Nov 4, 2026 03:071,543240,517,469227,145,0004,325,00016,793,600
6Nov 4, 2026 03:071,544240,657,757227,283,0004,377,00016,793,600
7Nov 4, 2026 03:071,544240,725,355227,355,0004,365,00016,793,600
8Nov 4, 2026 03:071,544240,700,248227,532,0004,207,00016,793,600
9Nov 4, 2026 03:071,545240,756,928227,623,0004,249,00016,793,600