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:35highload-churnerhighload-churnerScore: 12,199Success
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:1112,13140,838,48627,245,0003,083,0002,117,632
2Oct 9, 2026 22:1112,14841,019,64328,258,0002,114,0002,117,632
3Oct 9, 2026 22:1112,16841,024,06727,310,0003,110,0002,117,632
4Oct 9, 2026 22:1112,17640,926,91427,342,0003,099,0002,117,632
5Oct 9, 2026 22:1112,19941,948,94427,305,0003,193,0002,117,632
6Oct 9, 2026 22:1112,22541,730,86927,484,0003,080,0002,117,632
7Oct 9, 2026 22:1112,24241,066,76828,495,0002,112,0002,117,632
8Oct 9, 2026 22:1112,27541,847,80127,549,0003,139,0002,117,632
9Oct 9, 2026 22:1112,32155,078,18027,636,0003,168,0002,117,632