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 04:38olliecrowolliecrowScore: 3,216Success
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 04:393,209498,187,534476,447,0004,994,00017,035,264
2Apr 26, 2026 04:393,211499,699,068477,788,0003,998,00017,186,816
3Apr 26, 2026 04:393,211499,634,723476,802,0004,997,00017,010,688
4Apr 26, 2026 04:393,215496,887,374476,281,0006,003,00017,174,528
5Apr 26, 2026 04:393,216499,061,039478,423,0004,003,00017,027,072
6Apr 26, 2026 04:393,217497,335,016475,640,0006,994,00017,182,720
7Apr 26, 2026 04:393,217498,316,640475,642,0006,994,00017,186,816
8Apr 26, 2026 04:393,217503,924,646476,595,0005,994,00017,182,720
9Apr 26, 2026 04:393,218505,344,498475,813,0006,997,00017,174,528