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 listApr 19, 2026 05:14Charles CabergsCharles CabergsScore: 4,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 05:144,050633,109,102600,575,0006,995,00016,977,920
2Apr 19, 2026 05:144,056635,107,339600,439,0007,992,00016,982,016
3Apr 19, 2026 05:144,064630,852,172601,579,0007,994,00016,977,920
4Apr 19, 2026 05:144,064634,038,381601,599,0007,994,00017,158,144
5Apr 19, 2026 05:144,065635,391,075602,780,0006,997,00016,977,920
6Apr 19, 2026 05:144,068630,999,119602,187,0008,002,00017,096,704
7Apr 19, 2026 05:144,072635,525,480603,834,0006,998,00016,953,344
8Apr 19, 2026 05:144,074637,146,180602,041,0009,000,00017,182,720
9Apr 19, 2026 05:144,078635,376,492604,689,0006,996,00016,973,824