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 11:03anboto1anboto1Score: 22,294Success
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 11:0420,8533,137,416,4163,106,215,00021,749,00016,793,600
2Jun 24, 2026 11:0422,0743,320,465,3483,289,022,00022,125,00016,793,600
3Jun 24, 2026 11:0422,2903,354,621,4383,321,199,00022,317,00016,793,600
4Jun 24, 2026 11:0422,2943,353,505,2373,321,744,00022,476,00016,793,600
5Jun 24, 2026 11:0422,2943,353,427,8883,322,121,00022,109,00016,793,600
6Jun 24, 2026 11:0422,3533,362,350,6953,330,612,00022,463,00016,793,600
7Jun 24, 2026 11:0422,3733,365,270,6923,333,841,00022,253,00016,793,600
8Jun 24, 2026 11:0422,4223,372,537,3123,340,812,00022,505,00016,793,600
9Jun 24, 2026 11:0424,2473,646,683,2723,614,241,00022,931,00016,793,600