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 7, 2026 20:32Josu San MartinJosu San MartinScore: 43,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 20:3243,5191,460,702,9791,278,321,000157,792,0002,449,408
2Jan 7, 2026 20:3243,8431,473,590,3781,267,966,000178,854,0002,334,720
3Jan 7, 2026 20:3244,3541,492,088,9281,288,954,000174,722,0002,523,136