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 21, 2026 17:42A_ShamanA_ShamanScore: 17,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:4216,44850,357,98737,686,0003,434,0002,113,536
2Jun 21, 2026 17:4216,60750,667,93438,033,0003,486,0002,113,536
3Jun 21, 2026 17:4216,94151,490,33839,027,0003,326,0002,113,536
4Jun 21, 2026 17:4217,03251,766,48739,273,0003,307,0002,113,536
5Jun 21, 2026 17:4217,36352,509,44039,259,0004,149,0002,113,536
6Jun 21, 2026 17:4217,51452,960,40540,374,0003,412,0002,113,536
7Jun 21, 2026 17:4217,54453,125,72740,494,0003,367,0002,113,536
8Jun 21, 2026 17:4217,57353,063,81640,576,0003,358,0002,113,536
9Jun 21, 2026 17:4217,62554,436,93640,570,0003,494,0002,113,536