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 12:37highload-churnerhighload-churnerScore: 1,644Success
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 12:371,49013,074,7312,555,0001,171,000524,288
2Oct 19, 2026 12:371,63013,950,2572,974,0001,102,000524,288
3Oct 19, 2026 12:371,63413,542,9832,920,0001,167,000524,288
4Oct 19, 2026 12:371,64113,436,3182,946,0001,158,000524,288
5Oct 19, 2026 12:371,64413,463,9782,933,0001,179,000524,288
6Oct 19, 2026 12:371,66515,387,4942,989,0001,175,000524,288
7Oct 19, 2026 12:371,66913,490,5803,012,0001,161,000524,288
8Oct 19, 2026 12:371,67113,494,0063,004,0001,174,000524,288
9Oct 19, 2026 12:371,67613,856,5253,020,0001,172,000524,288