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:24highload-churnerhighload-churnerScore: 3,608Success
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:023,49819,149,0017,677,0001,069,0002,117,632
2Oct 10, 2026 01:023,50818,931,1507,703,0001,069,0002,117,632
3Oct 10, 2026 01:023,51518,990,6317,717,0001,071,0002,113,536
4Oct 10, 2026 01:023,59019,232,1077,896,0001,081,0002,117,632
5Oct 10, 2026 01:023,60819,223,4947,939,0001,082,0002,117,632
6Oct 10, 2026 01:023,62619,294,9457,973,0001,092,0002,117,632
7Oct 10, 2026 01:023,63419,523,9237,999,0001,087,0002,117,632
8Oct 10, 2026 01:023,63619,335,7918,004,0001,086,0002,117,632
9Oct 10, 2026 01:023,65619,289,3368,044,0001,096,0002,117,632