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 listApr 13, 2026 17:57Oleg SkinderevOleg SkinderevScore: 84,252Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 17:5783,8502,797,543,2022,750,070,00016,994,0002,420,736
2Apr 13, 2026 17:5784,2522,814,735,8682,763,333,00016,989,0002,355,200
3Apr 13, 2026 17:5784,8592,825,585,6412,781,355,00018,988,0002,334,720