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 24, 2026 10:49anboto1anboto1Score: 21,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:5021,0323,164,170,2703,133,229,00021,663,00016,793,600
2Jun 24, 2026 10:5021,0623,170,289,9643,137,537,00021,765,00016,793,600
3Jun 24, 2026 10:5021,1033,175,011,4353,144,197,00021,324,00016,793,600
4Jun 24, 2026 10:5021,1443,180,918,8753,150,240,00021,435,00016,793,600
5Jun 24, 2026 10:5021,1813,186,455,1823,155,486,00021,685,00016,793,600
6Jun 24, 2026 10:5021,2803,201,356,4453,170,411,00021,704,00016,793,600
7Jun 24, 2026 10:5023,6323,554,392,8823,522,506,00022,440,00016,793,600
8Jun 24, 2026 10:5023,7053,566,745,8143,533,695,00022,078,00016,793,600
9Jun 24, 2026 10:5023,9323,599,565,2953,567,527,00022,307,00016,793,600