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 listOct 21, 2025 09:24AnSaAnSaScore: 12,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2025 09:2412,0031,831,626,2561,782,474,00017,954,00017,108,992
2Oct 21, 2025 09:2412,1461,847,764,4031,807,865,00013,968,00017,117,184
3Oct 21, 2025 09:2412,1931,861,803,9201,812,010,00016,962,00017,121,280
4Oct 21, 2025 09:2412,2671,872,422,6901,824,060,00015,956,00016,965,632
5Oct 21, 2025 09:2412,2741,875,777,6881,823,166,00017,952,00017,096,704
6Oct 21, 2025 09:2412,4141,898,523,7951,853,115,0008,976,00016,957,440
7Oct 21, 2025 09:2412,4741,899,907,8111,851,226,00019,948,00016,949,248
8Oct 21, 2025 09:2412,4931,901,693,2241,862,920,00010,970,00016,957,440
9Oct 21, 2025 09:2412,5561,908,336,6361,871,382,00011,970,00017,031,168