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 30, 2025 19:25KeefeKeefeScore: 36,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2025 19:2436,353117,032,96278,898,00011,984,0002,297,856
2Jan 30, 2025 19:2436,405118,747,90182,011,0009,001,0002,490,368
3Jan 30, 2025 19:2536,431115,677,44281,069,00010,008,0002,482,176
4Jan 30, 2025 19:2436,437120,032,16082,084,0009,009,0002,510,848
5Jan 30, 2025 19:2536,556122,296,41481,348,00010,043,0002,486,272
6Jan 30, 2025 19:2536,958121,684,67281,349,00011,047,0002,437,120