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 listJan 10, 2026 06:58Josu San MartinJosu San MartinScore: 5,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 06:495,507210,825,946177,751,0003,994,0002,392,064
2Jan 10, 2026 06:585,510205,620,549177,827,0003,996,0002,351,104
3Jan 10, 2026 06:495,514207,317,509177,978,0003,999,0002,322,432
4Jan 10, 2026 06:585,519203,960,573178,133,0004,002,0002,437,120
5Jan 10, 2026 06:495,535213,093,771178,670,0003,992,0002,383,872
6Jan 10, 2026 06:585,633211,824,340183,901,0001,998,0002,412,544