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 05:20Victor MerckléVictor MerckléScore: 3,431Success
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 05:243,31017,720,2586,072,0002,205,0002,142,208stderr
2Jul 7, 2026 05:243,31517,664,8505,971,0002,317,0002,142,208stderr
3Jul 7, 2026 05:243,35817,819,4795,408,0002,989,0002,195,456stderr
4Jul 7, 2026 05:243,41517,907,6905,501,0003,037,0002,195,456stderr
5Jul 7, 2026 05:243,43117,956,3016,246,0002,333,0002,142,208stderr
6Jul 7, 2026 05:243,43919,372,4116,367,0002,231,0002,142,208stderr
7Jul 7, 2026 05:243,46718,055,0916,406,0002,263,0002,142,208stderr
8Jul 7, 2026 05:243,48118,078,4476,347,0002,357,0002,142,208stderr
9Jul 7, 2026 05:243,52818,230,8855,762,0003,058,0002,195,456stderr