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 10, 2026 00:31highload-churnerhighload-churnerScore: 3,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 02:013,50619,125,5837,697,0001,070,0002,117,632
2Oct 10, 2026 02:013,56819,203,6027,840,0001,080,0002,117,632
3Oct 10, 2026 02:013,58619,155,1637,886,0001,081,0002,117,632
4Oct 10, 2026 02:013,58819,345,8747,889,0001,082,0002,117,632
5Oct 10, 2026 02:013,59819,252,7807,914,0001,083,0002,117,632
6Oct 10, 2026 02:013,59919,229,3127,917,0001,082,0002,117,632
7Oct 10, 2026 02:013,60119,233,6917,920,0001,083,0002,117,632
8Oct 10, 2026 02:013,60219,326,4297,924,0001,081,0002,117,632
9Oct 10, 2026 02:013,60919,351,1067,943,0001,081,0002,117,632