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 listFeb 5, 2026 03:43Josu San MartinJosu San MartinScore: 5,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 03:435,71935,875,04110,213,0004,085,0002,494,464
2Feb 5, 2026 03:445,73030,993,0108,186,0006,140,0002,506,752
3Feb 5, 2026 03:445,73532,144,8489,217,0005,121,0002,502,656
4Feb 5, 2026 03:445,74332,109,9328,204,0006,153,0002,510,848
5Feb 5, 2026 03:445,74436,119,9097,180,0007,180,0002,318,336
6Feb 5, 2026 03:445,74630,963,8029,234,0005,130,0002,355,200
7Feb 5, 2026 03:435,76131,313,4978,230,0006,173,0002,334,720
8Feb 5, 2026 03:435,77331,531,8889,278,0005,154,0002,297,856
9Feb 5, 2026 03:435,77730,398,0139,285,0005,158,0002,502,656
10Feb 5, 2026 03:435,79733,203,5589,317,0005,176,0002,338,816
11Feb 5, 2026 03:435,80932,092,9009,336,0005,186,0002,506,752
12Feb 5, 2026 03:435,81239,449,4809,341,0005,189,0002,355,200
13Feb 5, 2026 03:445,81235,942,07410,379,0004,151,0002,338,816
14Feb 5, 2026 03:445,81942,331,7239,352,0005,195,0002,506,752
15Feb 5, 2026 03:435,83233,098,6869,374,0005,207,0002,322,432
16Feb 5, 2026 03:445,83332,496,5909,374,0005,208,0002,293,760
17Feb 5, 2026 03:445,84635,753,7539,395,0005,219,0002,273,280
18Feb 5, 2026 03:436,08246,218,67811,151,0004,055,0002,285,568