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:30Josu San MartinJosu San MartinScore: 51,234Success
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:3051,1761,713,455,8141,663,810,00024,982,0002,510,848
2Jan 2, 2026 05:3051,2341,715,857,0651,667,728,00022,982,0002,277,376
3Jan 2, 2026 05:3052,0791,752,413,2021,691,624,00026,978,0002,281,472