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 29, 2025 15:57Josu San MartinJosu San MartinScore: 27,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 15:5727,42894,026,83163,529,0005,042,0002,285,568
2Dec 29, 2025 15:5727,43993,719,11160,527,0008,070,0002,273,280
3Dec 29, 2025 15:5727,55097,286,80659,891,0008,983,0002,359,296