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 13, 2026 22:54Victor MerckléVictor MerckléScore: 6,888Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 22:546,87726,360,86513,861,0003,332,0002,117,632
2Jun 13, 2026 22:546,87726,359,80513,877,0003,316,0002,117,632
3Jun 13, 2026 22:546,87926,317,50813,787,0003,412,0002,117,632
4Jun 13, 2026 22:546,88126,331,55613,956,0003,247,0002,117,632
5Jun 13, 2026 22:546,88826,359,00913,880,0003,342,0002,117,632
6Jun 13, 2026 22:546,93426,471,28013,904,0003,431,0002,117,632
7Jun 13, 2026 22:546,95426,498,69313,940,0003,445,0002,117,632
8Jun 13, 2026 22:546,97826,638,68814,005,0003,440,0002,117,632
9Jun 13, 2026 22:547,03926,700,00814,326,0003,273,0002,125,824