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:00highload-churnerhighload-churnerScore: 4,494Success
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 01:364,36421,164,2769,813,0001,097,0002,117,632
2Oct 10, 2026 01:364,47821,389,59410,092,0001,104,0002,117,632
3Oct 10, 2026 01:364,48822,021,07610,118,0001,104,0002,117,632
4Oct 10, 2026 01:364,49021,382,45410,122,0001,104,0002,117,632
5Oct 10, 2026 01:364,49421,496,50610,134,0001,103,0002,117,632
6Oct 10, 2026 01:364,50021,430,89010,148,0001,103,0002,117,632
7Oct 10, 2026 01:364,51221,612,06210,177,0001,105,0002,117,632
8Oct 10, 2026 01:364,51522,073,57910,186,0001,103,0002,117,632
9Oct 10, 2026 01:364,57521,826,5899,355,0002,084,0002,117,632