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 23, 2025 05:25Josu San MartinJosu San MartinScore: 28,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 05:2527,93793,294,32561,861,0007,982,0002,289,664
2Dec 23, 2025 05:2528,03094,858,56664,069,0006,006,0002,273,280
3Dec 23, 2025 05:2528,64399,846,92664,548,0007,059,0002,293,760