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 11, 2026 10:37Tomislav TunkovicTomislav TunkovicScore: 1,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 10:381,898294,827,571274,666,00010,115,00016,801,792stderr
2Aug 11, 2026 10:381,898294,990,009274,669,00010,154,00016,801,792stderr
3Aug 11, 2026 10:381,900295,016,518275,026,00010,051,00016,801,792stderr
4Aug 11, 2026 10:381,901296,489,161275,027,00010,180,00016,801,792stderr
5Aug 11, 2026 10:381,901295,122,469275,101,00010,058,00016,801,792stderr
6Aug 11, 2026 10:381,902296,085,146275,038,00010,287,00016,801,792stderr
7Aug 11, 2026 10:381,902295,334,227275,222,00010,120,00016,801,792stderr
8Aug 11, 2026 10:381,903295,559,868275,433,00010,165,00016,801,792stderr
9Aug 11, 2026 10:381,905295,766,824275,675,00010,140,00016,801,792stderr