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 listJan 16, 2026 04:03Josu San MartinJosu San MartinScore: 9,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2026 04:039,80853,156,68817,368,0007,151,0002,326,528
2Jan 16, 2026 04:039,83750,826,80618,444,0006,148,0002,347,008
3Jan 16, 2026 04:039,86355,366,19021,575,0003,082,0002,334,720