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:25highload-churnerhighload-churnerScore: 3,415Success
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:033,38519,293,6277,118,0001,345,0002,117,632
2Oct 10, 2026 01:033,39918,971,1447,151,0001,347,0002,117,632
3Oct 10, 2026 01:033,40318,880,9307,167,0001,341,0002,117,632
4Oct 10, 2026 01:033,40519,304,8917,152,0001,361,0002,117,632
5Oct 10, 2026 01:033,41519,339,4267,469,0001,070,0002,117,632
6Oct 10, 2026 01:033,42118,745,3997,186,0001,368,0002,117,632
7Oct 10, 2026 01:033,42218,803,4107,185,0001,370,0002,117,632
8Oct 10, 2026 01:033,42418,817,5387,189,0001,373,0002,117,632
9Oct 10, 2026 01:033,44419,396,4977,531,0001,081,0002,117,632