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 listMar 5, 2026 22:50Sergey SerebryakovSergey SerebryakovScore: 3,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2026 22:503,328525,643,439491,197,0008,003,00016,986,112
2Mar 5, 2026 22:503,329527,779,048490,399,0008,988,00016,986,112
3Mar 5, 2026 22:503,330528,336,690491,439,0007,990,00017,084,416
4Mar 5, 2026 22:503,331524,042,354493,630,0005,995,00016,977,920
5Mar 5, 2026 22:503,332522,870,231492,747,0006,996,00017,072,128
6Mar 5, 2026 22:503,332520,324,297492,757,0006,996,00016,986,112
7Mar 5, 2026 22:503,333523,718,736491,921,0007,998,00016,986,112
8Mar 5, 2026 22:503,333522,607,915495,024,0005,000,00017,084,416
9Mar 5, 2026 22:503,334531,950,171492,080,0008,001,00017,002,496