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 15:59Josu San MartinJosu San MartinScore: 27,546Success
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 15:5927,31091,451,78663,256,0005,020,0002,519,040
2Dec 29, 2025 15:5927,54694,866,23157,886,00010,978,0002,342,912
3Dec 29, 2025 15:5927,59294,642,73861,983,0006,998,0002,363,392