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 11, 2026 02:23izotoffizotoffScore: 8,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 02:178,1021,243,322,3301,172,289,00042,973,00017,051,648
2Mar 11, 2026 02:238,1521,257,927,5811,175,850,00046,994,00016,998,400
3Mar 11, 2026 02:178,1731,254,809,2391,179,905,00045,996,00017,002,496
4Mar 11, 2026 02:238,1821,251,240,5931,181,258,00045,971,00016,945,152
5Mar 11, 2026 02:238,2171,255,936,9011,189,498,00042,981,00017,129,472
6Mar 11, 2026 02:178,2501,264,957,4711,193,469,00043,980,00017,002,496