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 listNov 8, 2026 09:32highload-churnerhighload-churnerScore: 1,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 09:331,14411,923,5511,597,0001,264,000524,288
2Nov 8, 2026 09:331,18612,014,9991,931,0001,036,000524,288
3Nov 8, 2026 09:331,22512,219,2292,048,0001,016,000524,288
4Nov 8, 2026 09:331,22912,119,7782,027,0001,046,000524,288
5Nov 8, 2026 09:331,23212,195,5322,061,0001,019,000524,288
6Nov 8, 2026 09:331,25212,305,2362,084,0001,047,000524,288
7Nov 8, 2026 09:331,25612,198,3581,616,0001,525,000524,288
8Nov 8, 2026 09:331,26312,259,8231,745,0001,413,000524,288
9Nov 8, 2026 09:331,27612,738,5012,130,0001,061,000524,288