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 listAug 17, 2026 13:00Victor MerckléVictor MerckléScore: 3,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 13:052,91616,899,5624,979,0002,313,0002,142,208stderr
2Aug 17, 2026 13:053,00017,095,7144,735,0002,766,0002,142,208stderr
3Aug 17, 2026 13:053,00417,541,9964,783,0002,728,0002,142,208stderr
4Aug 17, 2026 13:053,00717,358,1864,891,0002,628,0002,142,208stderr
5Aug 17, 2026 13:053,01617,359,6914,789,0002,752,0002,142,208stderr
6Aug 17, 2026 13:053,02217,262,7534,817,0002,740,0002,142,208stderr
7Aug 17, 2026 13:053,03317,270,7285,218,0002,366,0002,142,208stderr
8Aug 17, 2026 13:053,05017,367,7725,234,0002,392,0002,142,208stderr
9Aug 17, 2026 13:053,05817,390,7725,273,0002,372,0002,142,208stderr