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 16, 2026 17:52Jasper EdbrookeJasper EdbrookeScore: 33,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 17:5233,8555,105,848,5314,968,308,000109,918,00017,195,008
2Apr 16, 2026 17:5233,8665,115,892,9024,964,017,000115,907,00017,186,816
3Apr 16, 2026 17:5233,8745,113,845,7234,971,147,000109,892,00017,088,512
4Apr 16, 2026 17:5233,8775,107,946,2374,971,719,000109,905,00017,203,200
5Apr 16, 2026 17:5233,8785,115,142,3554,972,745,000108,906,00017,149,952
6Apr 16, 2026 17:5233,8825,114,427,1164,973,378,000108,920,00017,149,952
7Apr 16, 2026 17:5233,8925,111,939,2604,981,870,000101,915,00017,010,688
8Apr 16, 2026 17:5233,8975,121,170,3224,969,620,000114,898,00016,990,208
9Apr 16, 2026 17:5233,9775,134,174,4074,985,658,000110,903,00017,121,280