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 9, 2026 22:09Josu San MartinJosu San MartinScore: 10,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 22:0910,067362,518,059326,218,0006,004,0002,293,760
2Jan 9, 2026 22:0910,108359,317,531328,576,0004,993,0002,490,368
3Jan 9, 2026 22:0910,123361,414,363326,068,0008,001,0002,273,280
4Jan 9, 2026 22:0910,138359,780,132326,572,0007,989,0002,375,680
5Jan 9, 2026 22:0910,175362,851,190325,767,0009,992,0002,326,528
6Jan 9, 2026 22:0910,189366,396,546331,248,0005,003,0002,359,296