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 listAug 31, 2026 00:05Tomislav TunkovicTomislav TunkovicScore: 1,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 00:071,38611,635,7433,467,0000524,288
2Aug 31, 2026 00:071,38713,047,4843,468,0000524,288
3Aug 31, 2026 00:071,48511,909,7533,713,0000524,288
4Aug 31, 2026 00:071,50111,847,1353,753,0000524,288
5Aug 31, 2026 00:071,52012,001,6243,800,0000524,288
6Aug 31, 2026 00:071,52211,927,7223,807,0000524,288
7Aug 31, 2026 00:071,53211,980,3413,830,0000524,288
8Aug 31, 2026 00:071,53811,966,1103,846,0000524,288
9Aug 31, 2026 00:071,54412,016,8313,862,0000524,288