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 16, 2026 21:21Jacob McDanielJacob McDanielScore: 24,399Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 21:2923,67768,038,46054,453,0004,741,0002,113,536
2May 16, 2026 21:2923,88769,661,99754,883,0004,835,0002,113,536
3May 16, 2026 21:2924,16869,099,85555,583,0004,839,0002,113,536
4May 16, 2026 21:2924,18069,054,78455,629,0004,822,0002,113,536
5May 16, 2026 21:2924,39971,563,02456,094,0004,905,0002,113,536
6May 16, 2026 21:2924,43669,777,91756,208,0004,882,0002,113,536
7May 16, 2026 21:2924,47669,980,82356,970,0004,222,0002,113,536
8May 16, 2026 21:2924,98674,499,53557,529,0004,938,0002,113,536
9May 16, 2026 21:2925,04772,482,57958,388,0004,231,0002,113,536