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 25, 2026 23:58olliecrowolliecrowScore: 3,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 23:583,164491,458,965469,673,0004,996,00017,039,360
2Apr 25, 2026 23:583,165492,851,485469,815,0004,998,00017,133,568
3Apr 25, 2026 23:583,165491,454,245469,776,0004,997,00017,121,280
4Apr 25, 2026 23:583,169493,132,166470,473,0004,994,00017,133,568
5Apr 25, 2026 23:583,170494,200,883470,544,0004,995,00017,121,280
6Apr 25, 2026 23:583,176495,241,626471,497,0004,994,00017,125,376
7Apr 25, 2026 23:583,177495,951,795471,573,0004,995,00017,129,472
8Apr 25, 2026 23:583,178496,661,734470,808,0005,997,00017,129,472
9Apr 25, 2026 23:583,443540,247,888511,534,0004,995,00017,117,184