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 1, 2026 07:10Josu San MartinJosu San MartinScore: 40,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 07:1040,3931,358,795,9741,198,169,000134,794,0002,404,352
2Jan 1, 2026 07:1040,8221,372,850,1681,213,326,000133,815,0002,465,792
3Jan 1, 2026 07:1041,7151,403,645,8051,226,737,000149,845,0002,453,504