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:56A_ShamanA_ShamanScore: 15,802Success
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:5615,73448,491,67635,052,0004,285,0002,113,536
2Jun 26, 2026 19:5615,73848,521,51635,044,0004,301,0002,113,536
3Jun 26, 2026 19:5615,75948,598,38235,203,0004,196,0002,113,536
4Jun 26, 2026 19:5615,80048,758,14435,292,0004,210,0002,113,536
5Jun 26, 2026 19:5615,80248,798,00735,276,0004,229,0002,113,536
6Jun 26, 2026 19:5615,80848,667,80435,311,0004,211,0002,113,536
7Jun 26, 2026 19:5615,86148,805,25135,103,0004,550,0002,113,536
8Jun 26, 2026 19:5615,86148,984,78835,407,0004,247,0002,113,536
9Jun 26, 2026 19:5616,04649,191,05435,831,0004,286,0002,113,536