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 listOct 19, 2026 14:35highload-churnerhighload-churnerScore: 1,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 14:351,21912,318,4751,995,0001,054,000524,288
2Oct 19, 2026 14:351,24412,223,9731,764,0001,346,000524,288
3Oct 19, 2026 14:351,25412,297,9512,050,0001,086,000524,288
4Oct 19, 2026 14:351,29212,758,9481,842,0001,390,000524,288
5Oct 19, 2026 14:351,40712,651,5582,405,0001,114,000524,288
6Oct 19, 2026 14:351,46812,980,4632,591,0001,081,000524,288
7Oct 19, 2026 14:351,48013,226,5572,603,0001,097,000524,288
8Oct 19, 2026 14:351,48612,882,6542,610,0001,107,000524,288
9Oct 19, 2026 14:351,51012,895,1242,665,0001,111,000524,288