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 listMar 21, 2026 21:12Yuriy LyfenkoYuriy LyfenkoScore: 3,743Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 21:123,67125,253,1218,159,0001,019,0002,510,848
2Mar 21, 2026 21:113,67624,423,8127,148,0002,042,0002,510,848
3Mar 21, 2026 21:113,67731,531,3619,193,00002,506,752
4Mar 21, 2026 21:113,68329,902,4898,184,0001,023,0002,498,560
5Mar 21, 2026 21:123,69025,166,8619,224,00002,498,560
6Mar 21, 2026 21:123,69228,568,0828,205,0001,025,0002,506,752
7Mar 21, 2026 21:113,69324,489,4358,207,0001,025,0002,510,848
8Mar 21, 2026 21:113,70624,854,4228,237,0001,029,0002,347,008
9Mar 21, 2026 21:123,71724,620,8048,260,0001,032,0002,510,848
10Mar 21, 2026 21:113,74326,507,4928,318,0001,039,0002,506,752
11Mar 21, 2026 21:123,78232,218,2778,404,0001,050,0002,510,848
12Mar 21, 2026 21:113,78528,884,5298,412,0001,051,0002,498,560
13Mar 21, 2026 21:123,79628,684,3928,437,0001,054,0002,490,368
14Mar 21, 2026 21:113,79626,549,8088,437,0001,054,0002,506,752
15Mar 21, 2026 21:123,80025,511,9658,445,0001,055,0002,510,848
16Mar 21, 2026 21:113,81120,619,2309,528,00002,506,752
17Mar 21, 2026 21:123,81928,706,8978,487,0001,060,0002,330,624
18Mar 21, 2026 21:123,84223,709,8369,606,00002,334,720