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 listSep 26, 2026 12:07Kevin HeaveyKevin HeaveyScore: 1,383Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 12:071,37312,620,3952,278,0001,156,000524,288
2Sep 26, 2026 12:071,37812,094,3222,434,0001,011,000524,288
3Sep 26, 2026 12:071,38112,674,2572,434,0001,019,000524,288
4Sep 26, 2026 12:071,38213,389,2022,283,0001,172,000524,288
5Sep 26, 2026 12:071,38312,154,9012,443,0001,015,000524,288
6Sep 26, 2026 12:071,38812,663,1652,298,0001,174,000524,288
7Sep 26, 2026 12:071,39712,681,2012,318,0001,176,000524,288
8Sep 26, 2026 12:071,39812,828,3542,312,0001,185,000524,288
9Sep 26, 2026 12:071,41012,173,1132,511,0001,014,000524,288