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 25, 2026 16:15Dominique GarmierDominique GarmierScore: 150,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 17:05150,290406,404,423372,727,0002,997,0002,293,760
2Mar 25, 2026 17:15150,292398,409,173372,734,0002,997,0002,482,176
3Mar 25, 2026 20:57150,354402,322,069372,886,0002,999,0002,318,336
4Mar 25, 2026 20:57150,368402,734,070372,921,0002,999,0002,297,856
5Mar 25, 2026 17:05150,393402,308,626372,983,0002,999,0002,482,176
6Mar 25, 2026 16:15150,422400,068,710373,056,0003,000,0002,412,544
7Mar 25, 2026 20:57150,473409,346,737373,181,0003,001,0002,297,856
8Mar 25, 2026 17:15150,506393,948,357373,262,0003,002,0002,297,856
9Mar 25, 2026 17:05150,516394,777,486373,288,0003,002,0002,473,984
10Mar 25, 2026 17:15151,096408,776,138375,741,0001,998,0002,297,856
11Mar 25, 2026 16:15152,450406,526,542373,145,0007,981,0002,482,176
12Mar 25, 2026 16:15153,486411,327,414381,718,0001,998,0002,297,856