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 listJun 24, 2026 13:04anboto1anboto1Score: 3,167Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 13:053,154482,398,171448,251,00024,938,00016,793,600
2Jun 24, 2026 13:053,158483,012,527448,030,00025,782,00016,793,600
3Jun 24, 2026 13:053,161483,417,859448,440,00025,846,00016,793,600
4Jun 24, 2026 13:053,166484,097,699449,848,00025,075,00016,793,600
5Jun 24, 2026 13:053,167484,361,349449,887,00025,200,00016,793,600
6Jun 24, 2026 13:053,169484,644,297450,373,00025,078,00016,793,600
7Jun 24, 2026 13:053,169484,510,692450,352,00025,056,00016,793,600
8Jun 24, 2026 13:053,169484,704,297449,145,00026,339,00016,793,600
9Jun 24, 2026 13:053,229503,234,222459,179,00025,318,00016,793,600