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:59Josu San MartinJosu San MartinScore: 27,381Success
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:5927,34395,810,97061,321,0007,036,0002,342,912
2Dec 29, 2025 15:5927,38199,992,56363,420,0005,033,0002,301,952
3Dec 29, 2025 15:5929,026102,135,66163,496,0009,070,0002,457,600