Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listMay 17, 2026 10:14M-RochatM-RochatScore: 4,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 10:154,30319,444,0339,695,0001,064,0002,117,632
2May 17, 2026 10:154,30919,499,9789,710,0001,063,0002,117,632
3May 17, 2026 10:154,31022,352,7589,708,0001,067,0002,121,728
4May 17, 2026 10:154,31119,518,0249,714,0001,065,0002,113,536
5May 17, 2026 10:154,42019,719,7269,977,0001,075,0002,113,536
6May 17, 2026 10:154,42419,732,1929,986,0001,074,0002,117,632
7May 17, 2026 10:154,42819,791,1769,995,0001,076,0002,117,632
8May 17, 2026 10:154,43019,763,20710,000,0001,075,0002,113,536
9May 17, 2026 10:154,43219,736,74310,007,0001,073,0002,113,536