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 13:03Victor MerckléVictor MerckléScore: 2,148Success
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 13:042,13913,071,7434,110,0001,238,0002,113,536
2Jun 2, 2026 13:042,14213,007,0454,113,0001,242,0002,113,536
3Jun 2, 2026 13:042,14412,977,8384,122,0001,240,0002,113,536
4Jun 2, 2026 13:042,14612,955,5564,124,0001,242,0002,113,536
5Jun 2, 2026 13:042,14813,044,0064,129,0001,242,0002,113,536
6Jun 2, 2026 13:042,17513,123,7264,176,0001,262,0002,113,536
7Jun 2, 2026 13:042,21713,211,1884,285,0001,258,0002,113,536
8Jun 2, 2026 13:042,22215,003,3694,309,0001,246,0002,113,536
9Jun 2, 2026 13:042,25113,338,6904,367,0001,261,0002,113,536