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 26, 2026 10:19olliecrowolliecrowScore: 3,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 10:203,177491,442,024471,693,0004,996,00017,182,720
2Apr 26, 2026 10:203,179494,581,028472,974,0003,999,00017,174,528
3Apr 26, 2026 10:203,179501,527,690472,974,0003,999,00017,174,528
4Apr 26, 2026 10:203,179493,702,641472,970,0003,999,00017,178,624
5Apr 26, 2026 10:203,182499,289,993473,301,0004,002,00017,166,336
6Apr 26, 2026 10:203,183496,336,280472,555,0004,995,00017,166,336
7Apr 26, 2026 10:203,185492,488,518472,874,0004,998,00017,014,784
8Apr 26, 2026 10:203,187495,633,138473,060,0005,000,00017,174,528
9Apr 26, 2026 10:203,190502,228,041473,565,0004,995,00016,973,824