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 19, 2026 17:06Dominique GarmierDominique GarmierScore: 5,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 10:055,285818,370,961759,744,00032,945,00017,043,456
2Mar 15, 2026 10:055,423837,167,297789,551,00023,956,00017,047,552
3Mar 15, 2026 10:055,428850,141,944781,312,00032,928,00017,047,552
4Mar 15, 2026 10:235,449849,374,734785,403,00031,935,00017,055,744
5Mar 19, 2026 17:065,451846,822,376782,685,00034,941,00016,977,920
6Mar 15, 2026 10:235,456850,197,136787,424,00030,938,00016,961,536
7Mar 19, 2026 17:065,460848,039,133786,053,00032,960,00017,051,648
8Mar 15, 2026 10:235,559863,016,222800,857,00032,952,00017,047,552
9Mar 19, 2026 17:065,604874,093,431811,691,00028,953,00017,178,624