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 listJun 4, 2026 18:07Elijah KinElijah KinScore: 4,252Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 18:074,20319,686,4997,197,0003,312,0002,117,632
2Jun 4, 2026 18:074,21119,664,6677,218,0003,311,0002,117,632
3Jun 4, 2026 18:074,22219,672,2677,278,0003,278,0002,117,632
4Jun 4, 2026 18:074,25019,756,1657,326,0003,300,0002,117,632
5Jun 4, 2026 18:074,25219,763,8957,353,0003,277,0002,117,632
6Jun 4, 2026 18:074,26819,856,1687,387,0003,285,0002,117,632
7Jun 4, 2026 18:074,27019,736,7667,368,0003,309,0002,117,632
8Jun 4, 2026 18:074,27819,873,4397,399,0003,298,0002,117,632
9Jun 4, 2026 18:074,32319,941,1587,497,0003,312,0002,117,632