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 22:25highload-churnerhighload-churnerScore: 4,560Success
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 23:434,54921,799,98810,288,0001,085,0002,117,632
2Oct 9, 2026 23:434,55121,882,71210,295,0001,084,0002,117,632
3Oct 9, 2026 23:434,55221,788,50210,296,0001,084,0002,117,632
4Oct 9, 2026 23:434,55921,897,76610,315,0001,083,0002,117,632
5Oct 9, 2026 23:434,56021,920,82110,314,0001,088,0002,117,632
6Oct 9, 2026 23:434,68022,776,74810,606,0001,096,0002,121,728
7Oct 9, 2026 23:434,69622,141,59510,646,0001,095,0002,117,632
8Oct 9, 2026 23:434,70622,841,85710,668,0001,099,0002,117,632
9Oct 9, 2026 23:434,70722,362,65210,673,0001,096,0002,121,728