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 20, 2026 15:18olliecrowolliecrowScore: 3,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 15:193,411534,199,027509,692,0001,998,00017,096,704
2Apr 20, 2026 15:193,411539,204,152510,747,000999,00017,121,280
3Apr 20, 2026 15:193,411537,584,072507,755,0003,998,00016,965,632
4Apr 20, 2026 15:193,411537,556,034507,736,0003,997,00017,145,856
5Apr 20, 2026 15:193,414538,239,378511,211,0001,000,00017,018,880
6Apr 20, 2026 15:193,414533,448,381508,246,0004,001,00017,100,800
7Apr 20, 2026 15:193,414541,467,489509,115,0003,000,00017,190,912
8Apr 20, 2026 15:193,415525,257,596508,295,0004,002,00016,994,304
9Apr 20, 2026 15:193,418535,605,029508,793,0003,998,00017,039,360