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 17, 2026 04:45marko1597marko1597Score: 2,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 05:022,538391,164,517375,519,0005,270,00016,801,792stderr
2Aug 17, 2026 05:022,544391,451,748376,237,0005,372,00016,801,792stderr
3Aug 17, 2026 05:022,553392,721,814377,622,0005,346,00016,801,792stderr
4Aug 17, 2026 05:022,553392,808,079377,887,0005,209,00016,801,792stderr
5Aug 17, 2026 05:022,554393,138,970377,958,0005,242,00016,801,792stderr
6Aug 17, 2026 05:022,563394,344,265379,246,0005,244,00016,801,792stderr
7Aug 17, 2026 05:022,564395,695,443379,407,0005,333,00016,801,792stderr
8Aug 17, 2026 05:022,568395,152,698380,076,0005,252,00016,801,792stderr
9Aug 17, 2026 05:022,574396,285,826380,823,0005,279,00016,801,792stderr