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 24, 2026 03:16Mehdi-Dehghan-FooladiMehdi-Dehghan-FooladiScore: 64,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 03:1764,7722,151,950,4492,126,489,00010,997,0002,437,120
2Apr 24, 2026 03:1764,7872,158,253,7792,126,986,00010,994,0002,318,336
3Apr 24, 2026 03:1764,8792,161,820,2752,129,016,00011,994,0002,449,408