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 11:21Victor MerckléVictor MerckléScore: 2,578Success
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 11:222,48614,234,0713,562,0002,653,0002,146,304stderr
2Jul 8, 2026 11:222,52015,167,3533,584,0002,718,0002,146,304stderr
3Jul 8, 2026 11:222,53414,296,6683,657,0002,680,0002,146,304stderr
4Jul 8, 2026 11:222,54315,099,5283,853,0002,506,0002,146,304stderr
5Jul 8, 2026 11:222,57814,391,0053,887,0002,558,0002,146,304stderr
6Jul 8, 2026 11:222,61214,496,9693,968,0002,564,0002,146,304stderr
7Jul 8, 2026 11:222,63416,047,5303,989,0002,596,0002,146,304stderr
8Jul 8, 2026 11:222,63715,289,7763,998,0002,595,0002,146,304stderr
9Jul 8, 2026 11:222,65315,467,6134,018,0002,615,0002,146,304stderr