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 20, 2026 08:13Jacob McDanielJacob McDanielScore: 2,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 08:132,75316,159,7385,663,0001,220,0002,121,728
2May 20, 2026 08:132,75518,431,2785,693,0001,196,0002,121,728
3May 20, 2026 08:132,76117,935,5275,699,0001,205,0002,121,728
4May 20, 2026 08:132,76218,557,3215,693,0001,212,0002,121,728
5May 20, 2026 08:132,76316,820,2475,698,0001,210,0002,121,728
6May 20, 2026 08:132,86918,247,1165,926,0001,248,0002,121,728
7May 20, 2026 08:132,91419,147,0555,993,0001,294,0002,121,728
8May 20, 2026 08:132,95517,454,4166,113,0001,276,0002,121,728
9May 20, 2026 08:133,05618,015,3026,376,0001,264,0002,121,728