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 5, 2026 18:31Victor MerckléVictor MerckléScore: 1,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 18:331,64112,103,7842,956,0001,147,0002,117,632stderr
2Jul 5, 2026 18:331,66412,202,8242,950,0001,212,0002,117,632stderr
3Jul 5, 2026 18:331,66512,144,4922,978,0001,186,0002,117,632stderr
4Jul 5, 2026 18:331,66712,229,9422,983,0001,186,0002,117,632stderr
5Jul 5, 2026 18:331,67012,172,6793,016,0001,159,0002,117,632stderr
6Jul 5, 2026 18:331,68812,190,9972,961,0001,259,0002,117,632stderr
7Jul 5, 2026 18:331,72812,277,9593,143,0001,178,0002,117,632stderr
8Jul 5, 2026 18:331,73712,412,0473,155,0001,188,0002,117,632stderr
9Jul 5, 2026 18:331,74212,360,7373,174,0001,183,0002,117,632stderr