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 17:09Tomislav TunkovicTomislav TunkovicScore: 1,636Success
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 17:101,632254,860,258236,499,0008,387,00016,027,648stderr
2Aug 15, 2026 17:101,633255,130,115235,727,0009,349,00016,027,648stderr
3Aug 15, 2026 17:101,636256,659,910236,105,0009,433,00016,027,648stderr
4Aug 15, 2026 17:101,636256,224,848237,076,0008,384,00016,027,648stderr
5Aug 15, 2026 17:101,636255,424,462235,989,0009,430,00016,027,648stderr
6Aug 15, 2026 17:101,636256,735,445237,079,0008,438,00016,027,648stderr
7Aug 15, 2026 17:101,637256,485,853237,245,0008,444,00016,027,648stderr
8Aug 15, 2026 17:101,638257,821,574237,339,0008,427,00016,027,648stderr
9Aug 15, 2026 17:101,640256,768,996237,545,0008,552,00016,027,648stderr