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 26, 2026 19:53A_ShamanA_ShamanScore: 16,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 19:5315,86148,801,09935,360,0004,293,0002,113,536
2Jun 26, 2026 19:5315,88348,836,10435,379,0004,329,0002,113,536
3Jun 26, 2026 19:5315,95149,014,12735,512,0004,367,0002,113,536
4Jun 26, 2026 19:5315,95649,043,49235,659,0004,231,0002,113,536
5Jun 26, 2026 19:5316,02649,657,45235,557,0004,509,0002,113,536
6Jun 26, 2026 19:5316,03149,206,56735,677,0004,402,0002,113,536
7Jun 26, 2026 19:5316,05449,274,79335,702,0004,433,0002,113,536
8Jun 26, 2026 19:5316,08649,322,80035,836,0004,380,0002,113,536
9Jun 26, 2026 19:5316,20050,992,18135,884,0004,616,0002,113,536