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 listMay 3, 2025 03:53KeefeKeefeError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2025 03:5300000Error: pos 0: expected 30 got 100
2May 3, 2025 03:5400000Error: pos 0: expected 0 got 100
3May 3, 2025 03:5400000Error: pos 0: expected 154 got 100
4May 3, 2025 03:5400000Error: pos 0: expected 48 got 100
5May 3, 2025 03:5500000Error: pos 0: expected 172 got 100