Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listJun 23, 2025 15:46Ian MckibbenIan MckibbenScore: 302,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 15:46299,8749,930,267,4709,865,863,00029,981,0002,330,624
2Jun 23, 2025 15:46300,1559,936,682,5849,871,126,00033,976,0002,355,200
3Jun 23, 2025 15:46300,9629,960,321,1979,906,758,00024,981,0002,289,664
4Jun 23, 2025 15:46302,62310,022,470,7649,948,600,00037,975,0002,318,336
5Jun 23, 2025 15:46304,01810,067,453,4589,992,609,00039,974,0002,465,792
6Jun 23, 2025 15:46305,14210,105,925,35910,032,715,00036,973,0002,428,928