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 listApr 23, 2026 21:39Charles CabergsCharles CabergsScore: 3,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 21:403,860592,867,243569,143,00010,002,00017,149,952
2Apr 23, 2026 21:403,860594,103,648569,035,00010,000,00017,006,592
3Apr 23, 2026 21:403,862597,025,097569,310,00010,005,00016,990,208
4Apr 23, 2026 21:403,862597,876,956569,348,00010,006,00017,141,760
5Apr 23, 2026 21:403,862595,559,817569,310,00010,005,00016,990,208
6Apr 23, 2026 21:403,863596,777,108569,567,0009,992,00016,990,208
7Apr 23, 2026 21:403,863598,179,798570,565,0008,993,00017,137,664
8Apr 23, 2026 21:403,866596,609,838569,985,0009,999,00016,998,400
9Apr 23, 2026 21:403,867599,336,135570,163,00010,002,00017,149,952