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 listFeb 16, 2026 18:06Valentin KofmanValentin KofmanScore: 4,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 18:064,188654,082,206613,312,00014,958,00017,170,432
2Feb 16, 2026 18:064,190652,715,868611,588,00016,960,00016,998,400
3Feb 16, 2026 18:064,191658,793,006611,695,00016,963,00016,961,536
4Feb 16, 2026 18:064,201654,731,579615,135,00014,978,00017,027,072
5Feb 16, 2026 18:064,201657,224,648619,147,00010,984,00017,063,936
6Feb 16, 2026 18:064,202657,959,052624,315,0005,993,00016,998,400
7Feb 16, 2026 18:064,203661,236,701615,507,00014,963,00017,035,264
8Feb 16, 2026 18:064,227658,076,325616,022,00017,971,00017,174,528
9Feb 16, 2026 18:064,229665,556,818618,441,00015,959,00017,178,624