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 6, 2026 14:08olliecrowolliecrowScore: 3,199Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 14:093,199495,536,727475,751,0004,141,00017,170,432
2May 6, 2026 14:093,199496,280,829475,872,0004,116,00017,170,432
3May 6, 2026 14:093,199497,935,962475,866,0004,119,00017,174,528
4May 6, 2026 14:093,199496,167,775475,715,0004,158,00017,162,240
5May 6, 2026 14:093,199494,114,997475,735,0004,119,00017,166,336
6May 6, 2026 14:093,202499,203,020476,187,0004,165,00017,174,528
7May 6, 2026 14:093,203500,874,325476,215,0004,328,00017,162,240
8May 6, 2026 14:093,203496,194,387476,180,0004,270,00017,162,240
9May 6, 2026 14:093,206499,549,222476,528,0004,503,00017,162,240