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 listJun 21, 2026 17:49A_ShamanA_ShamanScore: 4,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:504,186637,346,076605,385,00022,633,00016,805,888
2Jun 21, 2026 17:504,207640,755,279608,219,00022,878,00016,805,888
3Jun 21, 2026 17:504,209641,156,045608,872,00022,587,00016,805,888
4Jun 21, 2026 17:504,214641,556,775608,755,00023,420,00016,805,888
5Jun 21, 2026 17:504,216641,752,523609,949,00022,510,00016,805,888
6Jun 21, 2026 17:504,230644,381,371611,591,00022,963,00016,805,888
7Jun 21, 2026 17:504,252647,642,664615,523,00022,310,00016,805,888
8Jun 21, 2026 17:504,277651,393,597618,932,00022,643,00016,805,888
9Jun 21, 2026 17:504,527688,386,520656,320,00022,761,00016,805,888