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:15highload-churnerhighload-churnerScore: 4,594Success
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 21:164,54421,847,13610,275,0001,086,0002,121,728
2Oct 9, 2026 21:164,54421,825,65310,277,0001,085,0002,121,728
3Oct 9, 2026 21:164,57122,004,54710,337,0001,091,0002,117,632
4Oct 9, 2026 21:164,58223,286,27510,365,0001,090,0002,117,632
5Oct 9, 2026 21:164,59422,029,59310,386,0001,100,0002,117,632
6Oct 9, 2026 21:164,66222,092,44210,558,0001,097,0002,121,728
7Oct 9, 2026 21:164,66422,403,60210,565,0001,097,0002,121,728
8Oct 9, 2026 21:164,68322,189,14310,614,0001,095,0002,121,728
9Oct 9, 2026 21:164,69022,800,64310,628,0001,099,0002,117,632