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:05Josu San MartinJosu San MartinScore: 27,438Success
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:0527,32097,594,99964,282,0004,017,0002,359,296
2Dec 29, 2025 16:0527,43893,129,38158,509,00010,087,0002,297,856
3Dec 29, 2025 16:0527,60891,762,04162,019,0007,002,0002,482,176