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 listMar 25, 2026 18:47Dominique GarmierDominique GarmierScore: 5,715,006Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 18:475,714,83814,315,325,48614,285,097,0001,999,0002,277,376
2Mar 25, 2026 18:475,715,00614,319,926,87014,286,517,000999,0002,277,376
3Mar 25, 2026 18:475,716,53214,323,812,17314,289,332,0001,998,0002,277,376