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 28, 2026 17:52Charles CabergsCharles CabergsScore: 3,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 17:533,819596,416,592567,914,0004,999,00017,125,376
2Apr 28, 2026 17:533,819592,386,637564,965,0007,999,00017,129,472
3Apr 28, 2026 17:533,820591,148,511566,004,0007,000,00017,203,200
4Apr 28, 2026 17:533,821593,571,934567,211,0006,002,00017,117,184
5Apr 28, 2026 17:533,822589,146,691564,387,0009,006,00017,113,088
6Apr 28, 2026 17:533,825594,266,230567,824,0005,998,00017,113,088
7Apr 28, 2026 17:533,826589,554,253568,026,0006,000,00017,117,184
8Apr 28, 2026 17:533,826592,747,473565,942,0007,999,00017,125,376
9Apr 28, 2026 17:533,826590,780,318565,999,0007,999,00017,043,456