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 18:08A_ShamanA_ShamanScore: 4,251Success
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 18:094,243646,538,778610,753,00025,795,00016,797,696
2Jun 21, 2026 18:094,247646,583,647610,662,00026,475,00016,793,600
3Jun 21, 2026 18:094,247646,489,617610,625,00026,556,00016,793,600
4Jun 21, 2026 18:094,248646,692,414610,665,00026,683,00016,797,696
5Jun 21, 2026 18:094,251647,101,948610,711,00027,025,00016,793,600
6Jun 21, 2026 18:094,254647,749,018611,465,00026,667,00016,793,600
7Jun 21, 2026 18:094,256647,767,393610,680,00027,791,00016,793,600
8Jun 21, 2026 18:094,256647,874,619611,228,00027,298,00016,793,600
9Jun 21, 2026 18:094,259648,713,102612,333,00026,625,00016,797,696