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 09:25Tomislav TunkovicTomislav TunkovicScore: 2,034Success
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 09:252,033315,604,755288,820,00016,212,00016,801,792stderr
2Aug 11, 2026 09:252,033315,750,743288,765,00016,248,00016,801,792stderr
3Aug 11, 2026 09:252,033315,063,047288,762,00016,232,00016,801,792stderr
4Aug 11, 2026 09:252,033315,640,171288,749,00016,240,00016,801,792stderr
5Aug 11, 2026 09:252,034315,697,467288,878,00016,316,00016,805,888stderr
6Aug 11, 2026 09:252,035316,490,997288,937,00016,348,00016,801,792stderr
7Aug 11, 2026 09:252,035315,722,485289,003,00016,284,00016,801,792stderr
8Aug 11, 2026 09:252,036315,666,275289,212,00016,230,00016,801,792stderr
9Aug 11, 2026 09:252,036316,298,995289,245,00016,277,00016,801,792stderr