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 29, 2025 16:06Josu San MartinJosu San MartinScore: 27,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 16:0627,31794,473,10760,259,0008,034,0002,387,968
2Dec 29, 2025 16:0627,39096,804,37064,447,0004,027,0002,506,752
3Dec 29, 2025 16:0628,07193,965,09563,160,0007,017,0002,510,848