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 09:32anboto1anboto1Score: 7,331Success
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 09:337,2671,099,174,4981,060,710,00029,384,00016,793,600
2Jun 24, 2026 09:337,2761,100,936,6651,061,685,00029,842,00016,793,600
3Jun 24, 2026 09:337,2791,101,330,1451,062,274,00029,673,00016,793,600
4Jun 24, 2026 09:337,3061,105,175,3361,066,953,00029,027,00016,793,600
5Jun 24, 2026 09:337,3311,108,877,0741,070,208,00029,478,00016,793,600
6Jun 24, 2026 09:337,3901,117,693,0401,079,452,00029,152,00016,793,600
7Jun 24, 2026 09:337,6721,160,209,1211,121,388,00029,502,00016,793,600
8Jun 24, 2026 09:337,6871,163,950,5391,123,389,00029,792,00016,793,600
9Jun 24, 2026 09:337,6891,162,548,1811,123,907,00029,498,00016,793,600