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:48Josu San MartinJosu San MartinScore: 74,478Success
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:4873,681210,890,249176,194,0008,008,0002,351,104
2Dec 23, 2025 04:4873,905209,434,902176,773,0007,989,0002,289,664
3Dec 23, 2025 04:4874,020213,687,660177,048,0008,002,0002,347,008
4Dec 23, 2025 04:4874,309210,091,216181,778,0003,995,0002,433,024
5Dec 23, 2025 04:4874,478210,974,768181,191,0005,005,0002,351,104
6Dec 23, 2025 04:4874,501212,845,974179,243,0007,009,0002,314,240
7Dec 23, 2025 04:4874,568213,914,969178,402,0008,018,0002,355,200
8Dec 23, 2025 04:4874,651211,626,114181,612,0005,016,0002,359,296
9Dec 23, 2025 04:4874,795216,867,168178,988,0007,999,0002,351,104