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 listAug 15, 2026 06:37Tomislav TunkovicTomislav TunkovicScore: 1,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 06:371,747272,156,370250,208,00011,889,00016,801,792stderr
2Aug 15, 2026 06:371,748272,329,165250,456,00011,875,00016,801,792stderr
3Aug 15, 2026 06:371,749272,513,435251,016,00011,467,00016,801,792stderr
4Aug 15, 2026 06:371,751272,955,414250,974,00011,715,00016,801,792stderr
5Aug 15, 2026 06:371,752273,626,124251,105,00011,707,00016,801,792stderr
6Aug 15, 2026 06:371,752274,105,652251,213,00011,591,00016,801,792stderr
7Aug 15, 2026 06:371,754273,288,169251,530,00011,719,00016,801,792stderr
8Aug 15, 2026 06:371,755274,017,131251,565,00011,717,00016,801,792stderr
9Aug 15, 2026 06:371,755273,929,457251,447,00011,803,00016,801,792stderr