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:49A_ShamanA_ShamanScore: 16,430Success
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:4916,25149,808,55336,319,0004,309,0002,113,536
2Jun 26, 2026 19:4916,29249,926,27736,394,0004,336,0002,113,536
3Jun 26, 2026 19:4916,41850,207,24036,868,0004,179,0002,113,536
4Jun 26, 2026 19:4916,42850,196,15136,556,0004,515,0002,113,536
5Jun 26, 2026 19:4916,43050,215,82436,863,0004,213,0002,113,536
6Jun 26, 2026 19:4916,43750,280,06036,797,0004,297,0002,113,536
7Jun 26, 2026 19:4916,53350,423,43137,199,0004,135,0002,113,536
8Jun 26, 2026 19:4916,59850,625,86336,910,0004,586,0002,113,536
9Jun 26, 2026 19:4916,67051,227,92237,284,0004,393,0002,113,536