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 listNov 8, 2026 05:10highload-churnerhighload-churnerScore: 1,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 05:111,539240,140,018226,192,0004,683,00016,019,456
2Nov 8, 2026 05:111,540240,538,420226,448,0004,665,00016,019,456
3Nov 8, 2026 05:111,540240,513,212226,424,0004,650,00016,019,456
4Nov 8, 2026 05:111,542240,795,669226,704,0004,648,00016,019,456
5Nov 8, 2026 05:111,542240,675,136226,710,0004,642,00016,019,456
6Nov 8, 2026 05:111,543240,835,449226,784,0004,731,00016,019,456
7Nov 8, 2026 05:111,543240,821,501226,808,0004,709,00016,019,456
8Nov 8, 2026 05:111,544240,969,151226,851,0004,771,00016,019,456
9Nov 8, 2026 05:111,544241,032,349226,890,0004,761,00016,019,456