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 2, 2026 09:56A_ShamanA_ShamanScore: 14,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 09:5614,05844,625,54729,132,0006,013,0002,113,536
2Jul 2, 2026 09:5614,07944,626,85529,220,0005,979,0002,113,536
3Jul 2, 2026 09:5614,11344,647,84829,344,0005,939,0002,113,536
4Jul 2, 2026 09:5614,15244,796,85829,499,0005,881,0002,113,536
5Jul 2, 2026 09:5614,16244,892,92829,480,0005,926,0002,113,536
6Jul 2, 2026 09:5614,55745,833,61530,126,0006,267,0002,113,536
7Jul 2, 2026 09:5614,68446,175,52430,757,0005,955,0002,113,536
8Jul 2, 2026 09:5614,86146,589,25431,211,0005,942,0002,113,536
9Jul 2, 2026 09:5614,92546,774,16831,352,0005,962,0002,113,536