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 8, 2026 12:54highload-churnerhighload-churnerScore: 1,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 12:551,15011,955,6932,875,0000524,288
2Nov 8, 2026 12:551,20912,171,5781,974,0001,049,000524,288
3Nov 8, 2026 12:551,25812,297,0342,132,0001,015,000524,288
4Nov 8, 2026 12:551,26412,190,9652,113,0001,049,000524,288
5Nov 8, 2026 12:551,27012,259,8061,792,0001,384,000524,288
6Nov 8, 2026 12:551,29312,398,5952,207,0001,027,000524,288
7Nov 8, 2026 12:551,29512,381,5632,196,0001,042,000524,288
8Nov 8, 2026 12:551,31412,384,3942,234,0001,052,000524,288
9Nov 8, 2026 12:551,32512,343,5742,252,0001,061,000524,288