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 05:44Josu San MartinJosu San MartinScore: 31,774Success
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 05:4331,721104,347,41371,273,0008,030,0002,469,888
2Dec 23, 2025 05:4331,756104,712,18472,355,0007,034,0002,314,240
3Dec 23, 2025 05:4331,771105,957,84371,384,0008,043,0002,502,656
4Dec 23, 2025 05:4431,774105,927,67269,380,00010,055,0002,478,080
5Dec 23, 2025 05:4431,935105,527,35969,858,0009,979,0002,486,272
6Dec 23, 2025 05:4432,084107,830,52371,186,0009,023,0002,310,144