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 4, 2026 21:12olliecrowolliecrowScore: 3,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 21:123,613571,185,475521,981,00019,999,00016,998,400
2Mar 4, 2026 21:123,614574,227,769516,136,00026,006,00017,080,320
3Mar 4, 2026 21:123,615574,370,457523,256,00019,009,00017,076,224
4Mar 4, 2026 21:123,616572,146,626520,470,00021,977,00017,055,744
5Mar 4, 2026 21:123,616567,141,952520,479,00021,978,00017,125,376
6Mar 4, 2026 21:123,617569,048,059524,593,00017,986,00017,055,744
7Mar 4, 2026 21:123,619571,485,532519,834,00022,992,00016,941,056
8Mar 4, 2026 21:123,620567,362,418520,963,00021,998,00017,055,744
9Mar 4, 2026 21:123,621570,974,143523,090,00020,003,00016,977,920