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 2, 2026 06:53Victor MerckléVictor MerckléScore: 2,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 06:552,16014,627,3894,161,0001,241,0002,113,536
2Jun 2, 2026 06:552,16413,052,3784,166,0001,244,0002,113,536
3Jun 2, 2026 06:552,17013,112,1884,182,0001,243,0002,113,536
4Jun 2, 2026 06:552,17113,083,3834,188,0001,241,0002,113,536
5Jun 2, 2026 06:552,19613,128,9574,230,0001,261,0002,113,536
6Jun 2, 2026 06:552,23113,215,6394,330,0001,249,0002,113,536
7Jun 2, 2026 06:552,24013,582,9894,352,0001,248,0002,113,536
8Jun 2, 2026 06:552,24513,177,6944,369,0001,244,0002,113,536
9Jun 2, 2026 06:552,27013,427,4724,419,0001,256,0002,113,536