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 15:05Victor MerckléVictor MerckléScore: 2,430Success
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 15:062,39214,664,3613,533,0002,449,0002,146,304stderr
2Jul 8, 2026 15:062,40015,054,7873,271,0002,729,0002,146,304stderr
3Jul 8, 2026 15:062,41914,667,8323,533,0002,515,0002,146,304stderr
4Jul 8, 2026 15:062,42915,003,2903,858,0002,216,0002,146,304stderr
5Jul 8, 2026 15:062,43015,203,1883,515,0002,562,0002,146,304stderr
6Jul 8, 2026 15:062,46614,645,5613,772,0002,393,0002,146,304stderr
7Jul 8, 2026 15:062,48015,125,0203,615,0002,587,0002,146,304stderr
8Jul 8, 2026 15:062,51914,961,0713,871,0002,427,0002,146,304stderr
9Jul 8, 2026 15:062,53215,004,8934,014,0002,316,0002,146,304stderr