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 27, 2026 23:27Dominique GarmierDominique GarmierScore: 3,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 23:273,263519,519,220463,518,00025,973,00017,006,592
2Mar 27, 2026 23:273,269517,726,885467,444,00022,972,00017,027,072
3Mar 27, 2026 23:273,272513,845,600464,878,00025,993,00017,018,880
4Mar 27, 2026 23:273,273522,463,157465,023,00026,001,00016,949,248
5Mar 27, 2026 23:273,276518,476,241458,446,00032,960,00017,186,816
6Mar 27, 2026 23:273,276518,523,812466,450,00024,970,00017,162,240
7Mar 27, 2026 23:273,276517,003,784469,479,00021,975,00016,965,632
8Mar 27, 2026 23:273,278522,952,972464,707,00026,983,00016,953,344
9Mar 27, 2026 23:273,283522,678,288464,433,00027,965,00017,022,976