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 20, 2026 15:20olliecrowolliecrowScore: 3,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 15:213,408542,437,401508,344,0003,002,00017,027,072
2Apr 20, 2026 15:213,408537,778,459507,300,0004,002,00016,965,632
3Apr 20, 2026 15:213,409536,444,188506,347,0005,003,00017,022,976
4Apr 20, 2026 15:213,410534,560,262509,543,0001,998,00017,027,072
5Apr 20, 2026 15:213,410538,441,096507,534,0003,996,00017,027,072
6Apr 20, 2026 15:213,411537,504,073506,754,0004,997,00017,010,688
7Apr 20, 2026 15:213,411543,568,111506,669,0004,996,00017,018,880
8Apr 20, 2026 15:213,416544,391,616507,534,0004,995,00017,027,072
9Apr 20, 2026 15:213,434539,597,759511,165,0004,001,00017,018,880