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 listDec 30, 2025 05:40Josu San MartinJosu San MartinScore: 38,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 05:4038,348120,572,59790,877,0004,993,0002,527,232
2Dec 30, 2025 05:4038,589126,699,08192,454,0004,019,0002,510,848
3Dec 30, 2025 05:4038,738126,419,79890,856,0005,990,0002,527,232