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 listApr 19, 2025 14:41KeefeKeefeError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2025 14:4100000Error: pos 0: expected 254 got 6
2Apr 19, 2025 14:4100000Error: pos 0: expected 186 got 6
3Apr 19, 2025 14:5700000Error: pos 0: expected 68 got 6
4Apr 19, 2025 14:5700000Error: pos 0: expected 204 got 6
5Apr 19, 2025 14:5700000Error: pos 0: expected 151 got 6
6Apr 19, 2025 14:5800000Error: pos 0: expected 100 got 6