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 listOct 22, 2025 09:04AnSaAnSaScore: 3,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2025 09:043,828597,190,823572,126,0002,000,00016,179,200
2Oct 22, 2025 09:043,828600,720,717572,219,0002,000,00016,179,200
3Oct 22, 2025 09:043,828597,487,166572,244,0002,000,00016,179,200
4Oct 22, 2025 09:043,828598,202,797572,254,0002,000,00016,179,200
5Oct 22, 2025 09:043,829598,325,027572,291,0002,001,00016,179,200
6Oct 22, 2025 09:043,829600,961,466572,357,0002,001,00016,179,200
7Oct 22, 2025 09:043,829599,321,242572,368,0002,001,00016,400,384
8Oct 22, 2025 09:043,830602,867,196572,563,0001,998,00016,179,200
9Oct 22, 2025 09:043,835596,413,696572,269,0003,001,00016,179,200