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 listMar 21, 2026 04:26Dominique GarmierDominique GarmierScore: 4,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 04:264,228660,175,209606,212,00028,009,00017,178,624
2Mar 21, 2026 04:264,230664,781,980604,595,00029,979,00017,186,816
3Mar 21, 2026 04:264,231663,139,164603,615,00030,980,00017,186,816
4Mar 21, 2026 04:264,232662,875,969606,766,00027,989,00017,002,496
5Mar 21, 2026 04:264,232663,787,182605,859,00028,993,00017,043,456
6Mar 21, 2026 04:264,234671,505,530607,076,00028,003,00017,178,624
7Mar 21, 2026 04:264,234668,434,742607,089,00028,004,00017,158,144
8Mar 21, 2026 04:264,235664,083,846605,240,00029,962,00017,170,432
9Mar 21, 2026 04:264,236662,316,763607,455,00027,974,00017,170,432