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:00Josu San MartinJosu San MartinScore: 27,414Success
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:0027,32998,850,78763,300,0005,023,0002,359,296
2Dec 29, 2025 16:0027,41496,685,47360,473,0008,063,0002,273,280
3Dec 29, 2025 16:0027,49096,062,27863,671,0005,053,0002,519,040