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 16:11Josu San MartinJosu San MartinScore: 27,470Success
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 16:1127,45499,301,01760,562,0008,074,0002,342,912
2Dec 29, 2025 16:1127,47098,249,43761,605,0007,069,0002,510,848
3Dec 29, 2025 16:1127,52893,844,47958,847,0009,974,0002,310,144