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 1, 2026 12:38Victor MerckléVictor MerckléScore: 2,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 12:402,51013,792,0684,951,0001,325,0002,113,536
2Jun 1, 2026 12:402,51413,954,8434,958,0001,327,0002,113,536
3Jun 1, 2026 12:402,51813,904,5334,969,0001,328,0002,113,536
4Jun 1, 2026 12:402,52213,921,6454,979,0001,327,0002,113,536
5Jun 1, 2026 12:402,52613,890,2644,986,0001,331,0002,113,536
6Jun 1, 2026 12:402,54414,005,2505,034,0001,328,0002,113,536
7Jun 1, 2026 12:402,54513,982,8745,020,0001,344,0002,113,536
8Jun 1, 2026 12:402,57013,953,6045,101,0001,324,0002,113,536
9Jun 1, 2026 12:402,61614,123,1545,220,0001,321,0002,113,536