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 29, 2026 21:36Dominique GarmierDominique GarmierScore: 363,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 21:36363,73454,616,455,52354,534,115,00025,986,00016,965,632
2Mar 29, 2026 21:36363,87554,638,893,82154,551,289,00029,985,00016,965,632
3Mar 29, 2026 21:36364,20154,688,327,81454,597,102,00032,984,00016,973,824