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 listNov 18, 2025 21:55Yuriy LyfenkoYuriy LyfenkoScore: 4,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2025 21:554,02330,866,3477,040,0003,017,0002,338,816
2Nov 18, 2025 21:554,03428,726,6328,068,0002,017,0002,363,392
3Nov 18, 2025 21:554,16926,176,8069,380,0001,042,0002,363,392