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 06:58highload-churnerhighload-churnerScore: 1,343Success
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 06:581,16412,007,2911,885,0001,026,000524,288
2Nov 8, 2026 06:581,21812,242,7331,540,0001,505,000524,288
3Nov 8, 2026 06:581,29812,420,3492,232,0001,015,000524,288
4Nov 8, 2026 06:581,34312,436,7812,308,0001,050,000524,288
5Nov 8, 2026 06:581,34312,466,9102,309,0001,050,000524,288
6Nov 8, 2026 06:581,34512,910,3851,965,0001,398,000524,288
7Nov 8, 2026 06:581,34612,417,4482,312,0001,054,000524,288
8Nov 8, 2026 06:581,36312,501,2802,360,0001,048,000524,288
9Nov 8, 2026 06:581,38513,439,9792,401,0001,063,000524,288