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 30, 2025 05:20Josu San MartinJosu San MartinScore: 20,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 05:2020,54779,482,12446,331,0005,036,0002,265,088
2Dec 30, 2025 05:2020,62378,966,56347,515,0004,043,0002,334,720
3Dec 30, 2025 05:2020,64678,199,64547,567,0004,048,0002,322,432
4Dec 30, 2025 05:2020,69379,240,62048,689,0003,043,0002,330,624
5Dec 30, 2025 05:2020,78874,840,93046,972,0004,997,0002,338,816
6Dec 30, 2025 05:2020,87177,836,42850,171,0002,006,0002,334,720
7Dec 30, 2025 05:2020,89481,464,95947,213,0005,022,0002,326,528
8Dec 30, 2025 05:2020,92685,457,22848,290,0004,024,0002,326,528
9Dec 30, 2025 05:2021,42876,235,83949,527,0004,043,0002,334,720