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 19:43Josu San MartinJosu San MartinScore: 9,541Success
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 19:539,417339,636,402307,776,0002,997,0002,375,680
2Jan 8, 2026 19:439,477339,052,099307,732,0004,995,0002,359,296
3Jan 8, 2026 19:539,478339,156,059309,776,0002,997,0002,486,272
4Jan 8, 2026 19:439,541343,817,456310,852,0003,998,0002,420,736
5Jan 8, 2026 19:539,728353,444,102317,017,0004,000,0002,383,872
6Jan 8, 2026 19:439,775354,004,165317,584,0004,993,0002,510,848