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 17, 2026 02:49Jasper EdbrookeJasper EdbrookeScore: 12,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 02:4912,0931,838,893,1001,723,068,00090,898,00017,063,936
2Apr 17, 2026 02:4912,2301,870,705,7711,756,664,00077,896,00017,199,104
3Apr 17, 2026 02:4912,2611,863,714,7501,736,293,000102,898,00017,047,552