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:03Josu San MartinJosu San MartinScore: 27,358Success
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:0327,21696,102,98561,036,0007,004,0002,519,040
2Dec 29, 2025 16:0327,35892,567,39759,342,0009,052,0002,359,296
3Dec 29, 2025 16:0328,83495,449,10064,077,0008,009,0002,514,944