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 26, 2026 20:27A_ShamanA_ShamanScore: 4,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 20:294,085622,098,264588,703,00024,195,00016,793,600
2Jun 26, 2026 20:294,085622,070,859588,195,00024,699,00016,793,600
3Jun 26, 2026 20:294,086622,148,658588,328,00024,650,00016,793,600
4Jun 26, 2026 20:294,087622,418,332588,193,00024,971,00016,793,600
5Jun 26, 2026 20:294,087622,251,058588,733,00024,440,00016,793,600
6Jun 26, 2026 20:294,088622,474,753588,739,00024,576,00016,793,600
7Jun 26, 2026 20:294,088622,620,233588,433,00024,905,00016,793,600
8Jun 26, 2026 20:294,090622,915,921588,841,00024,802,00016,793,600
9Jun 26, 2026 20:294,092623,083,097589,552,00024,389,00016,793,600