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 30, 2026 00:57Dominique GarmierDominique GarmierScore: 4,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 15:044,836760,078,243708,357,00016,984,00017,203,200
2Mar 30, 2026 00:574,842756,552,409708,387,00017,984,00016,977,920
3Mar 30, 2026 15:044,842752,428,401712,370,00013,987,00017,154,048
4Mar 30, 2026 00:574,844749,891,172716,636,0009,994,00016,977,920
5Mar 30, 2026 00:574,859757,430,281713,805,00014,995,00017,088,512
6Mar 30, 2026 15:044,863762,296,945718,457,00010,991,00016,977,920