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:07Josu San MartinJosu San MartinScore: 27,334Success
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:0727,311100,152,69058,237,00010,040,0002,519,040
2Dec 29, 2025 16:0727,33497,748,70860,297,0008,039,0002,273,280
3Dec 29, 2025 16:0727,62393,188,04160,051,0009,007,0002,355,200