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 listApr 24, 2026 12:47olliecrowolliecrowScore: 3,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 12:513,165489,682,264469,762,0004,997,00017,133,568
2Apr 24, 2026 12:513,166491,796,578470,927,0003,999,00017,121,280
3Apr 24, 2026 12:513,166491,925,169471,950,0002,999,00017,215,488
4Apr 24, 2026 12:513,171493,828,312471,656,0003,997,00017,121,280
5Apr 24, 2026 12:513,176494,885,847472,444,0004,003,00017,129,472
6Apr 24, 2026 12:513,178494,016,445469,710,0006,995,00017,141,760
7Apr 24, 2026 12:513,178494,614,568472,842,0003,998,00017,137,664
8Apr 24, 2026 12:513,180494,101,755472,019,0005,000,00017,133,568
9Apr 24, 2026 12:513,184491,615,001472,694,0004,996,00017,133,568