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 listNov 17, 2025 05:31Yuriy LyfenkoYuriy LyfenkoScore: 51,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2025 05:3151,405155,472,136116,464,00012,048,0002,523,136
2Nov 17, 2025 05:3151,414154,381,389118,493,00010,041,0002,523,136
3Nov 17, 2025 05:3151,419152,877,825115,493,00013,055,0002,301,952
4Nov 17, 2025 05:3151,448154,851,503121,586,0007,033,0002,424,832
5Nov 17, 2025 05:3151,474156,032,146120,642,0008,042,0002,293,760
6Nov 17, 2025 05:3151,524159,033,322115,830,00012,980,0002,281,472
7Nov 17, 2025 05:3151,528157,880,849118,833,0009,986,0002,510,848
8Nov 17, 2025 05:3151,676155,030,219121,178,0008,011,0002,293,760
9Nov 17, 2025 05:3151,922155,129,066119,743,00010,062,0002,297,856