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:35Josu San MartinJosu San MartinScore: 33,397Success
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:4533,150109,302,00979,880,0002,995,0002,326,528
2Dec 30, 2025 05:4533,236108,171,70281,088,0002,002,0002,326,528
3Dec 30, 2025 05:4533,303112,036,70077,240,0006,018,0002,326,528
4Dec 30, 2025 05:3533,397108,840,86677,458,0006,035,0002,433,024
5Dec 30, 2025 05:3533,487114,843,37178,674,0005,043,0002,433,024
6Dec 30, 2025 05:3533,771109,046,90880,407,0004,020,0002,338,816