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 06:37Victor MerckléVictor MerckléScore: 2,484Success
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 06:392,45014,196,6423,639,0002,488,0002,146,304stderr
2Jul 8, 2026 06:392,45914,123,0863,511,0002,637,0002,146,304stderr
3Jul 8, 2026 06:392,47314,240,8123,538,0002,646,0002,146,304stderr
4Jul 8, 2026 06:392,47515,060,1123,523,0002,666,0002,146,304stderr
5Jul 8, 2026 06:392,48414,467,3423,529,0002,681,0002,146,304stderr
6Jul 8, 2026 06:392,48614,332,7873,519,0002,697,0002,146,304stderr
7Jul 8, 2026 06:392,50714,184,4053,532,0002,736,0002,146,304stderr
8Jul 8, 2026 06:392,70114,977,2414,017,0002,737,0002,146,304stderr
9Jul 8, 2026 06:392,70614,773,3174,080,0002,686,0002,146,304stderr