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 listJul 16, 2026 19:53Andrew TsibinAndrew TsibinScore: 4,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 19:534,52521,511,62910,240,0001,073,0002,113,536
2Jul 16, 2026 19:534,54621,193,00610,296,0001,071,0002,113,536
3Jul 16, 2026 19:534,55021,526,76210,304,0001,073,0002,113,536
4Jul 16, 2026 19:534,55120,941,52610,305,0001,073,0002,113,536
5Jul 16, 2026 19:534,55221,447,77810,308,0001,074,0002,113,536
6Jul 16, 2026 19:534,56321,602,46210,333,0001,076,0002,113,536
7Jul 16, 2026 19:534,56620,996,86810,344,0001,072,0002,113,536
8Jul 16, 2026 19:534,56821,619,39110,345,0001,076,0002,113,536
9Jul 16, 2026 19:534,56820,960,53210,341,0001,080,0002,113,536