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 listJul 8, 2026 00:24Victor MerckléVictor MerckléScore: 2,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 00:252,64014,629,0534,226,0002,376,0002,146,304stderr
2Jul 8, 2026 00:252,65916,162,3424,155,0002,494,0002,146,304stderr
3Jul 8, 2026 00:252,66316,399,5344,142,0002,516,0002,146,304stderr
4Jul 8, 2026 00:252,67217,856,0524,272,0002,410,0002,146,304stderr
5Jul 8, 2026 00:252,68715,945,5224,286,0002,432,0002,146,304stderr
6Jul 8, 2026 00:252,70915,864,0084,560,0002,214,0002,146,304stderr
7Jul 8, 2026 00:252,81216,529,1394,686,0002,344,0002,146,304stderr
8Jul 8, 2026 00:252,87616,643,4764,741,0002,451,0002,146,304stderr
9Jul 8, 2026 00:252,90016,675,8364,810,0002,441,0002,146,304stderr