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:48Victor MerckléVictor MerckléScore: 3,408Success
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:523,34417,771,1226,019,0002,342,0002,142,208stderr
2Jul 8, 2026 06:523,34617,797,6274,999,0003,366,0002,195,456stderr
3Jul 8, 2026 06:523,35717,805,1975,029,0003,364,0002,195,456stderr
4Jul 8, 2026 06:523,39117,804,0085,897,0002,582,0002,142,208stderr
5Jul 8, 2026 06:523,40817,867,6686,035,0002,487,0002,138,112stderr
6Jul 8, 2026 06:523,43417,911,2815,880,0002,707,0002,138,112stderr
7Jul 8, 2026 06:523,43717,925,8285,954,0002,640,0002,142,208stderr
8Jul 8, 2026 06:523,45518,073,6216,426,0002,213,0002,142,208stderr
9Jul 8, 2026 06:523,49618,140,5546,139,0002,603,0002,134,016stderr