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 listMar 19, 2026 18:37Dominique GarmierDominique GarmierScore: 15,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 19:1815,40763,669,80534,463,0004,054,0002,428,928
2Mar 19, 2026 18:3715,41064,595,41834,469,0004,055,0002,506,752
3Mar 19, 2026 19:1815,45173,053,56835,579,0003,049,0002,437,120
4Mar 19, 2026 18:3715,46166,583,83634,584,0004,068,0002,424,832
5Mar 19, 2026 19:1815,55864,162,76932,911,0005,983,0002,482,176
6Mar 19, 2026 18:3715,58158,094,68234,957,0003,995,0002,265,088