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 9, 2026 09:51Tomislav TunkovicTomislav TunkovicScore: 4,376Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2026 09:514,373666,086,278643,201,00012,812,00016,801,792stderr
2Aug 9, 2026 09:514,373666,170,553643,102,00012,876,00016,801,792stderr
3Aug 9, 2026 09:514,373666,280,778643,216,00012,876,00016,801,792stderr
4Aug 9, 2026 09:514,376667,295,247643,652,00012,841,00016,801,792stderr
5Aug 9, 2026 09:514,376666,513,015643,717,00012,763,00016,801,792stderr
6Aug 9, 2026 09:514,378666,869,349644,038,00012,758,00016,801,792stderr
7Aug 9, 2026 09:514,381667,835,431644,320,00012,929,00016,801,792stderr
8Aug 9, 2026 09:514,382668,521,314644,398,00012,945,00016,801,792stderr
9Aug 9, 2026 09:514,383667,521,620644,556,00012,909,00016,801,792stderr