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 listDec 23, 2025 04:57Josu San MartinJosu San MartinScore: 51,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 04:5751,226154,513,825120,060,0008,004,0002,453,504
2Dec 23, 2025 04:5751,325151,344,677119,291,0009,022,0002,473,984
3Dec 23, 2025 04:5751,363154,894,279120,382,0008,025,0002,342,912
4Dec 23, 2025 04:5751,367155,214,164122,399,0006,019,0002,351,104
5Dec 23, 2025 04:5751,372156,163,615118,396,00010,033,0002,310,144
6Dec 23, 2025 04:5751,375154,850,561118,403,00010,034,0002,482,176
7Dec 23, 2025 04:5751,381156,744,062118,418,00010,035,0002,482,176
8Dec 23, 2025 04:5751,401157,915,320119,468,0009,035,0002,482,176
9Dec 23, 2025 04:5751,409152,486,364118,482,00010,040,0002,469,888
10Dec 23, 2025 04:5751,436159,708,075117,540,00011,050,0002,482,176
11Dec 23, 2025 04:5751,454159,659,710123,612,0005,024,0002,465,792
12Dec 23, 2025 04:5751,525159,085,253120,824,0007,988,0002,412,544