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 4, 2026 19:32olliecrowolliecrowScore: 3,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 19:323,867611,386,652569,072,00011,001,00017,129,472
2Mar 4, 2026 19:323,867607,018,318570,107,00010,001,00017,178,624
3Mar 4, 2026 19:323,867606,023,439567,107,00013,002,00017,190,912
4Mar 4, 2026 19:323,869610,573,595568,340,00011,986,00017,182,720
5Mar 4, 2026 19:323,870606,362,808571,439,0008,991,00016,949,248
6Mar 4, 2026 19:323,871610,665,724571,719,0008,995,00016,949,248
7Mar 4, 2026 19:323,876607,357,892570,452,00010,989,00017,178,624
8Mar 4, 2026 19:323,887611,301,278571,076,00012,001,00017,125,376
9Mar 4, 2026 19:323,892610,916,502573,761,0009,995,00017,174,528