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 15:59highload-churnerhighload-churnerScore: 12,327Success
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 16:2412,31539,704,76128,692,0002,097,0002,117,632
2Oct 9, 2026 16:2412,32739,801,24828,724,0002,094,0002,117,632
3Oct 9, 2026 16:2412,34841,916,69228,771,0002,101,0002,117,632