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 listJul 14, 2026 10:40Victor MerckléVictor MerckléScore: 2,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 10:432,239346,198,356327,519,0008,464,00016,801,792stderr
2Jul 14, 2026 10:432,239345,546,188327,739,0008,184,00016,801,792stderr
3Jul 14, 2026 10:432,240345,691,167327,963,0008,140,00016,801,792stderr
4Jul 14, 2026 10:432,240345,704,345327,859,0008,266,00016,801,792stderr
5Jul 14, 2026 10:432,240345,693,783327,904,0008,185,00016,801,792stderr
6Jul 14, 2026 10:432,244346,388,115328,552,0008,174,00016,801,792stderr
7Jul 14, 2026 10:432,245347,859,986328,572,0008,220,00016,801,792stderr
8Jul 14, 2026 10:432,246347,153,317328,915,0008,099,00016,801,792stderr
9Jul 14, 2026 10:432,249347,168,008329,265,0008,208,00016,801,792stderr