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:36highload-churnerhighload-churnerScore: 4,601Success
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:124,55621,961,31410,305,0001,087,0002,117,632
2Oct 9, 2026 22:124,56021,937,47510,313,0001,088,0002,117,632
3Oct 9, 2026 22:124,56622,618,25610,328,0001,087,0002,117,632
4Oct 9, 2026 22:124,57621,919,00110,353,0001,088,0002,117,632
5Oct 9, 2026 22:124,60122,053,75310,405,0001,098,0002,117,632
6Oct 9, 2026 22:124,62122,063,81710,454,0001,100,0002,117,632
7Oct 9, 2026 22:124,64822,113,99910,523,0001,097,0002,117,632
8Oct 9, 2026 22:124,64934,115,71510,530,0001,093,0002,117,632
9Oct 9, 2026 22:124,66022,774,40010,554,0001,097,0002,117,632