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 13:52highload-churnerhighload-churnerScore: 1,454Success
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 13:521,27612,360,9341,823,0001,369,000524,288
2Oct 19, 2026 13:521,35012,481,2332,315,0001,060,000524,288
3Oct 19, 2026 13:521,37712,695,3462,352,0001,092,000524,288
4Oct 19, 2026 13:521,42512,729,4232,482,0001,081,000524,288
5Oct 19, 2026 13:521,45412,817,7442,554,0001,083,000524,288
6Oct 19, 2026 13:521,47812,958,3112,596,0001,101,000524,288
7Oct 19, 2026 13:521,47912,955,1592,614,0001,084,000524,288
8Oct 19, 2026 13:521,49212,893,9972,633,0001,097,000524,288
9Oct 19, 2026 13:521,55413,273,9162,804,0001,082,000524,288