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:41highload-churnerhighload-churnerScore: 1,339Success
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:421,16012,019,3082,902,0000524,288
2Nov 8, 2026 06:421,18612,068,0361,738,0001,228,000524,288
3Nov 8, 2026 06:421,26112,263,8161,754,0001,399,000524,288
4Nov 8, 2026 06:421,32512,939,7112,119,0001,194,000524,288
5Nov 8, 2026 06:421,33912,423,5882,136,0001,213,000524,288
6Nov 8, 2026 06:421,34612,468,5182,107,0001,260,000524,288
7Nov 8, 2026 06:421,35412,096,8652,136,0001,249,000524,288
8Nov 8, 2026 06:421,35412,437,6032,150,0001,236,000524,288
9Nov 8, 2026 06:421,37512,664,5212,187,0001,251,000524,288