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 2, 2026 05:07Josu San MartinJosu San MartinScore: 61,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 05:0761,5312,066,418,5931,818,782,000211,741,0002,416,640
2Jan 2, 2026 05:0761,8612,067,313,4121,844,555,000196,845,0002,428,928
3Jan 2, 2026 05:0762,2972,086,848,9711,835,050,000220,765,0002,285,568