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 27, 2026 02:33Dominique GarmierDominique GarmierScore: 48,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 02:3348,105143,653,299117,257,0003,006,0002,330,624
2Mar 27, 2026 02:3348,121147,063,656115,290,0005,012,0002,318,336
3Mar 27, 2026 02:3348,135150,984,784113,318,0007,019,0002,420,736