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 08:52Victor MerckléVictor MerckléScore: 3,263Success
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 08:563,24317,423,4355,510,0002,599,0002,142,208stderr
2Jul 8, 2026 08:563,24517,502,9614,795,0003,318,0002,195,456stderr
3Jul 8, 2026 08:563,24717,607,5395,517,0002,601,0002,134,016stderr
4Jul 8, 2026 08:563,24817,434,7805,503,0002,617,0002,142,208stderr
5Jul 8, 2026 08:563,26317,535,7935,877,0002,281,0002,142,208stderr
6Jul 8, 2026 08:563,26417,531,9434,805,0003,356,0002,195,456stderr
7Jul 8, 2026 08:563,26817,642,4415,873,0002,298,0002,142,208stderr
8Jul 8, 2026 08:563,30917,602,9885,980,0002,293,0002,142,208stderr
9Jul 8, 2026 08:563,31117,677,3085,992,0002,287,0002,134,016stderr