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 10:16olliecrowolliecrowScore: 3,176Success
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 10:193,173484,328,702470,642,0005,438,00017,117,184
2May 6, 2026 10:193,174484,274,647470,590,0005,514,00017,129,472
3May 6, 2026 10:193,175484,557,497470,897,0005,496,00017,113,088
4May 6, 2026 10:193,175484,380,221470,807,0005,469,00017,117,184
5May 6, 2026 10:193,176486,875,009470,958,0005,491,00017,125,376
6May 6, 2026 10:193,176484,670,656470,980,0005,478,00017,108,992
7May 6, 2026 10:193,178486,989,766471,020,0005,749,00017,125,376
8May 6, 2026 10:193,183485,567,880472,175,0005,275,00017,113,088
9May 6, 2026 10:193,184485,807,547472,478,0005,130,00017,113,088