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:19Victor MerckléVictor MerckléScore: 2,238Success
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:202,15613,051,7534,139,0001,252,0002,113,536
2Jun 2, 2026 13:202,15714,614,3654,146,0001,247,0002,113,536
3Jun 2, 2026 13:202,15913,010,8164,152,0001,246,0002,113,536
4Jun 2, 2026 13:202,23413,189,6464,341,0001,246,0002,113,536
5Jun 2, 2026 13:202,23813,311,9924,348,0001,249,0002,113,536
6Jun 2, 2026 13:202,24113,249,5874,354,0001,249,0002,113,536
7Jun 2, 2026 13:202,25313,274,8444,388,0001,246,0002,113,536
8Jun 2, 2026 13:202,27513,284,8204,418,0001,270,0002,113,536
9Jun 2, 2026 13:202,27613,293,7834,425,0001,266,0002,113,536