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 7, 2026 06:37olliecrowolliecrowScore: 3,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 06:373,183496,560,692473,397,0004,095,00017,166,336
2May 7, 2026 06:373,184497,007,659473,536,0004,191,00017,162,240
3May 7, 2026 06:373,184493,568,355473,457,0004,219,00017,170,432
4May 7, 2026 06:373,185496,791,376473,713,0004,166,00017,166,336
5May 7, 2026 06:373,186498,289,051473,782,0004,149,00017,166,336
6May 7, 2026 06:373,189496,990,471474,193,0004,242,00017,166,336
7May 7, 2026 06:373,190494,663,257474,368,0004,140,00017,170,432
8May 7, 2026 06:373,191497,556,933474,318,0004,428,00017,166,336
9May 7, 2026 06:373,192496,406,440474,442,0004,478,00017,166,336