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 listMay 6, 2026 05:45olliecrowolliecrowScore: 3,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 05:463,154493,164,841469,659,0003,446,00017,121,280
2May 6, 2026 05:463,157490,283,183470,470,0003,214,00017,121,280
3May 6, 2026 05:463,157490,008,008470,118,0003,456,00017,121,280
4May 6, 2026 05:463,163488,646,447469,850,0004,609,00017,108,992
5May 6, 2026 05:463,166489,280,783470,240,0004,784,00017,117,184
6May 6, 2026 05:463,167495,269,735470,486,0004,660,00017,117,184
7May 6, 2026 05:463,167493,403,669470,555,0004,631,00017,104,896
8May 6, 2026 05:463,170491,914,351471,423,0004,200,00017,121,280
9May 6, 2026 05:463,171492,313,391471,118,0004,648,00017,113,088