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 04:22Josu San MartinJosu San MartinScore: 9,579Success
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 04:229,563339,762,522305,588,0009,986,0002,506,752
2Jan 9, 2026 04:229,571336,165,342306,858,0008,995,0002,392,064
3Jan 9, 2026 04:229,576347,051,587309,013,0007,000,0002,363,392
4Jan 9, 2026 04:229,579341,805,242309,106,0007,002,0002,363,392
5Jan 9, 2026 04:229,593341,799,629308,569,0007,988,0002,367,488
6Jan 9, 2026 04:229,607346,553,627309,042,0008,001,0002,363,392