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 listJul 2, 2026 11:03A_ShamanA_ShamanScore: 3,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 11:043,962603,857,329572,139,00022,283,00016,793,600
2Jul 2, 2026 11:043,962603,696,332572,180,00022,128,00016,793,600
3Jul 2, 2026 11:043,965604,192,422572,749,00022,009,00016,793,600
4Jul 2, 2026 11:043,966604,371,508573,017,00021,915,00016,793,600
5Jul 2, 2026 11:043,967604,702,863573,348,00021,843,00016,793,600
6Jul 2, 2026 11:043,972605,227,328573,673,00022,137,00016,793,600
7Jul 2, 2026 11:043,972605,327,838573,659,00022,193,00016,793,600
8Jul 2, 2026 11:043,974605,693,606574,343,00021,848,00016,793,600
9Jul 2, 2026 11:043,979608,186,954574,386,00022,532,00016,793,600