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 06:40highload-churnerhighload-churnerScore: 1,304Success
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 06:411,13812,039,2911,653,0001,193,000524,288
2Nov 8, 2026 06:411,19912,116,0941,566,0001,432,000524,288
3Nov 8, 2026 06:411,24612,235,5831,899,0001,218,000524,288
4Nov 8, 2026 06:411,27312,286,8181,963,0001,221,000524,288
5Nov 8, 2026 06:411,30412,452,5182,237,0001,024,000524,288
6Nov 8, 2026 06:411,32212,596,7042,291,0001,014,000524,288
7Nov 8, 2026 06:411,32512,424,4832,266,0001,048,000524,288
8Nov 8, 2026 06:411,35612,458,6192,157,0001,235,000524,288
9Nov 8, 2026 06:411,36612,442,6202,202,0001,214,000524,288