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 21, 2026 16:19Dominique GarmierDominique GarmierScore: 4,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 16:194,649722,414,914680,447,00016,961,00016,953,344
2Mar 21, 2026 16:194,650727,071,023679,552,00017,961,00017,088,512
3Mar 21, 2026 16:194,659729,769,582685,841,00012,978,00017,104,896
4Mar 21, 2026 16:194,671729,206,726684,649,00015,968,00016,965,632
5Mar 21, 2026 16:194,675743,382,446683,314,00017,981,00016,953,344
6Mar 21, 2026 16:194,726745,570,892691,960,00016,974,00017,100,800