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:40Dominique GarmierDominique GarmierScore: 49,812Success
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:4049,724146,706,749121,304,0003,007,0002,318,336
2Mar 27, 2026 02:4049,812157,840,333119,510,0005,021,0002,322,432
3Mar 27, 2026 02:4049,829152,073,693121,560,0003,013,0002,408,448