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 listJan 29, 2025 11:43KeefeKeefeScore: 41,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2025 11:4340,761128,490,98691,913,0009,990,0002,281,472
2Jan 29, 2025 11:4341,106132,639,96795,781,0006,984,0002,428,928
3Jan 29, 2025 11:4341,390130,449,17495,438,0008,036,0002,314,240
4Jan 29, 2025 11:4341,403133,122,77396,474,0007,034,0002,318,336
5Jan 29, 2025 11:4341,514126,140,13993,806,0009,979,0002,265,088
6Jan 29, 2025 11:4341,523131,406,02995,745,0008,062,0002,359,296
7Jan 29, 2025 11:4341,597131,498,88595,993,0007,999,0002,420,736
8Jan 29, 2025 11:4341,857133,987,51296,593,0008,049,0002,310,144
9Jan 29, 2025 11:4342,022134,731,52798,052,0007,003,0002,289,664