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:39KeefeKeefeError
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:3900000Error: pos 0: expected 80 got 30
2Apr 19, 2025 14:3900000Error: pos 0: expected 250 got 30
3Apr 19, 2025 14:3900000Error: pos 0: expected 99 got 30
4Apr 19, 2025 14:3900000Error: pos 0: expected 228 got 30
5Apr 19, 2025 14:3900000Error: pos 0: expected 100 got 30
6Apr 19, 2025 14:3900000Error: pos 0: expected 60 got 30
7Apr 19, 2025 14:4000000Error: pos 0: expected 170 got 30
8Apr 19, 2025 14:4000000Error: pos 0: expected 78 got 30
9Apr 19, 2025 14:4000000Error: pos 0: expected 134 got 30
10Apr 19, 2025 14:4000000Error: pos 0: expected 75 got 30
11Apr 19, 2025 14:4000000Error: pos 0: expected 132 got 30
12Apr 19, 2025 14:4000000Error: pos 0: expected 124 got 30
13Apr 19, 2025 14:4000000Error: pos 0: expected 8 got 30