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 13:48anboto1anboto1Score: 3,115Success
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 13:483,088472,411,039438,412,00024,821,00016,793,600
2Jun 24, 2026 13:483,091472,911,991438,700,00025,092,00016,793,600
3Jun 24, 2026 13:483,091472,734,809439,008,00024,685,00016,793,600
4Jun 24, 2026 13:483,106474,966,274440,292,00025,640,00016,793,600
5Jun 24, 2026 13:483,115476,432,171440,837,00026,462,00016,793,600
6Jun 24, 2026 13:483,116476,508,604441,017,00026,408,00016,793,600
7Jun 24, 2026 13:483,126478,113,740443,453,00025,569,00016,793,600
8Jun 24, 2026 13:483,127478,182,181443,239,00025,817,00016,793,600
9Jun 24, 2026 13:483,127478,141,527443,529,00025,564,00016,793,600