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 15:11highload-churnerhighload-churnerScore: 1,432Success
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 15:111,21012,112,9541,760,0001,266,000524,288
2Oct 19, 2026 15:111,32612,870,3622,044,0001,273,000524,288
3Oct 19, 2026 15:111,39612,556,7122,395,0001,095,000524,288
4Oct 19, 2026 15:111,42812,829,2272,301,0001,270,000524,288
5Oct 19, 2026 15:111,43212,883,2572,300,0001,282,000524,288
6Oct 19, 2026 15:111,43812,774,6202,308,0001,287,000524,288
7Oct 19, 2026 15:111,46012,807,3602,521,0001,131,000524,288
8Oct 19, 2026 15:111,50512,832,4952,470,0001,293,000524,288
9Oct 19, 2026 15:111,50812,967,4172,473,0001,297,000524,288