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 10, 2026 00:32highload-churnerhighload-churnerScore: 3,394Success
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 02:013,33420,137,2017,109,0001,228,0002,117,632
2Oct 10, 2026 02:013,36518,754,2817,153,0001,261,0002,117,632
3Oct 10, 2026 02:013,37618,754,0487,100,0001,342,0002,117,632
4Oct 10, 2026 02:013,38218,814,1467,396,0001,059,0002,117,632
5Oct 10, 2026 02:013,39418,695,5807,148,0001,337,0002,117,632
6Oct 10, 2026 02:013,40218,762,9457,149,0001,356,0002,117,632
7Oct 10, 2026 02:013,40318,838,6847,150,0001,358,0002,117,632
8Oct 10, 2026 02:013,40818,830,4757,154,0001,366,0002,117,632
9Oct 10, 2026 02:013,41018,741,6707,186,0001,341,0002,117,632