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 9, 2026 21:34highload-churnerhighload-churnerScore: 7,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 22:107,38429,047,82014,111,0004,350,0002,117,632
2Oct 9, 2026 22:107,43629,095,57514,161,0004,430,0002,117,632
3Oct 9, 2026 22:107,48329,360,76514,252,0004,457,0002,117,632
4Oct 9, 2026 22:107,52629,357,97913,566,0005,251,0002,117,632
5Oct 9, 2026 22:107,57629,626,41613,649,0005,292,0002,117,632
6Oct 9, 2026 22:107,64829,754,25413,751,0005,371,0002,117,632
7Oct 9, 2026 22:107,96530,677,19815,543,0004,371,0002,117,632
8Oct 9, 2026 22:108,18231,669,68316,027,0004,428,0002,117,632
9Oct 9, 2026 22:108,29931,963,43315,506,0005,242,0002,117,632