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 23:57highload-churnerhighload-churnerScore: 4,231Success
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:354,12420,557,0659,226,0001,086,0002,117,632
2Oct 10, 2026 01:354,14920,645,3699,286,0001,087,0002,117,632
3Oct 10, 2026 01:354,22620,860,6799,470,0001,096,0002,117,632
4Oct 10, 2026 01:354,22920,822,6089,478,0001,096,0002,117,632
5Oct 10, 2026 01:354,23121,290,5619,483,0001,096,0002,117,632
6Oct 10, 2026 01:354,23420,840,0779,490,0001,096,0002,117,632
7Oct 10, 2026 01:354,23421,381,4099,492,0001,095,0002,117,632
8Oct 10, 2026 01:354,24120,796,2429,507,0001,096,0002,117,632
9Oct 10, 2026 01:354,24820,838,5629,524,0001,098,0002,117,632