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 7, 2026 16:49Victor MerckléVictor MerckléScore: 3,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 16:523,39117,821,7676,288,0002,190,0002,142,208stderr
2Jul 7, 2026 16:523,45317,997,4075,645,0002,989,0002,195,456stderr
3Jul 7, 2026 16:523,46317,940,4286,470,0002,189,0002,142,208stderr
4Jul 7, 2026 16:523,47920,420,3646,482,0002,216,0002,142,208stderr
5Jul 7, 2026 16:523,49318,019,5596,554,0002,179,0002,138,112stderr
6Jul 7, 2026 16:523,49718,092,7596,540,0002,203,0002,142,208stderr
7Jul 7, 2026 16:523,50818,064,1575,746,0003,025,0002,191,360stderr
8Jul 7, 2026 16:523,51818,121,7376,597,0002,200,0002,142,208stderr
9Jul 7, 2026 16:523,52018,194,2166,483,0002,317,0002,134,016stderr