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 8, 2026 20:41Josu San MartinJosu San MartinScore: 9,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 20:419,943358,645,668324,111,0004,001,0002,334,720
2Jan 8, 2026 20:419,957359,786,715323,573,0005,008,0002,330,624
3Jan 8, 2026 20:419,963355,495,812323,790,0004,996,0002,338,816
4Jan 8, 2026 20:419,998355,855,335325,939,0003,999,0002,449,408
5Jan 8, 2026 20:4110,025357,936,091325,842,0004,997,0002,342,912
6Jan 8, 2026 20:4110,179363,778,887330,906,0004,998,0002,334,720