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 14, 2026 07:25Victor MerckléVictor MerckléScore: 1,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 07:271,65812,286,4743,054,0001,093,0002,117,632stderr
2Jul 14, 2026 07:271,66012,197,2713,062,0001,088,0002,117,632stderr
3Jul 14, 2026 07:271,73312,943,5923,214,0001,120,0002,117,632stderr
4Jul 14, 2026 07:271,73912,288,4133,135,0001,213,0002,117,632stderr
5Jul 14, 2026 07:271,76012,487,3143,283,0001,117,0002,117,632stderr
6Jul 14, 2026 07:271,78412,538,0003,313,0001,148,0002,117,632stderr
7Jul 14, 2026 07:271,79012,572,5723,325,0001,151,0002,117,632stderr
8Jul 14, 2026 07:271,79412,486,5583,353,0001,133,0002,117,632stderr
9Jul 14, 2026 07:271,79812,725,8113,278,0001,219,0002,117,632stderr