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 5, 2026 18:00Victor MerckléVictor MerckléScore: 1,652Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 18:021,60211,989,1472,880,0001,126,0002,117,632stderr
2Jul 5, 2026 18:021,61812,073,6362,903,0001,144,0002,117,632stderr
3Jul 5, 2026 18:021,62112,132,0242,902,0001,151,0002,117,632stderr
4Jul 5, 2026 18:021,64512,122,5842,961,0001,153,0002,117,632stderr
5Jul 5, 2026 18:021,65212,122,5482,965,0001,166,0002,117,632stderr
6Jul 5, 2026 18:021,68112,232,1243,037,0001,167,0002,117,632stderr
7Jul 5, 2026 18:021,68912,256,7103,024,0001,200,0002,117,632stderr
8Jul 5, 2026 18:021,72612,342,9733,138,0001,179,0002,117,632stderr
9Jul 5, 2026 18:021,73512,339,5123,147,0001,192,0002,117,632stderr