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 4, 2026 00:00Andrew EpsteinAndrew EpsteinScore: 15,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 00:0015,7742,375,810,7442,328,167,00038,046,00016,801,792stderr
2Nov 4, 2026 00:0015,7762,375,954,1692,328,583,00037,903,00016,801,792stderr
3Nov 4, 2026 00:0015,7762,376,420,2652,328,537,00037,955,00016,801,792stderr
4Nov 4, 2026 00:0015,7782,376,686,3662,328,539,00038,168,00016,801,792stderr
5Nov 4, 2026 00:0015,7792,376,390,5852,328,919,00037,978,00016,801,792stderr
6Nov 4, 2026 00:0015,7792,376,313,9612,329,114,00037,836,00016,801,792stderr
7Nov 4, 2026 00:0015,8112,381,060,3912,333,487,00038,237,00016,801,792stderr
8Nov 4, 2026 00:0015,8112,382,134,9852,333,435,00038,309,00016,801,792stderr
9Nov 4, 2026 00:0015,8132,381,908,8602,333,820,00038,237,00016,801,792stderr