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 14, 2025 17:06izotoffizotoffScore: 35,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2025 17:0634,809112,620,65085,023,0002,000,0002,306,048
2Nov 14, 2025 17:0635,064116,755,11187,659,00002,531,328
3Nov 14, 2025 17:0635,183119,115,88986,959,000999,0002,420,736