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 listAug 14, 2026 16:25Tomislav TunkovicTomislav TunkovicScore: 4,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 16:334,16418,743,6899,257,0001,154,0002,121,728
2Aug 14, 2026 16:334,18220,004,6729,304,0001,153,0002,121,728
3Aug 14, 2026 16:334,19618,861,7079,323,0001,167,0002,121,728
4Aug 14, 2026 16:334,20018,882,2739,322,0001,179,0002,121,728
5Aug 14, 2026 16:334,38219,308,1529,791,0001,166,0002,121,728
6Aug 14, 2026 16:334,44319,274,9759,927,0001,181,0002,121,728
7Aug 14, 2026 16:334,49419,558,07810,086,0001,151,0002,121,728
8Aug 14, 2026 16:334,49619,634,48510,071,0001,169,0002,121,728
9Aug 14, 2026 16:334,52219,705,91210,145,0001,162,0002,121,728