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 11:19anboto1anboto1Score: 5,150Success
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 11:205,004760,051,117724,004,00026,699,00016,793,600
2Jun 24, 2026 11:205,130779,443,374743,390,00026,185,00016,793,600
3Jun 24, 2026 11:205,131779,444,970743,179,00026,512,00016,793,600
4Jun 24, 2026 11:205,136779,750,396742,879,00027,622,00016,793,600
5Jun 24, 2026 11:205,150781,798,921745,398,00027,148,00016,793,600
6Jun 24, 2026 11:205,153782,149,550745,803,00027,173,00016,793,600
7Jun 24, 2026 11:205,155782,583,440746,554,00026,798,00016,793,600
8Jun 24, 2026 11:205,156782,674,118747,121,00026,424,00016,793,600
9Jun 24, 2026 11:205,164783,800,219748,225,00026,427,00016,793,600