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 13, 2026 23:00Josu San MartinJosu San MartinScore: 5,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 23:005,149199,986,891165,922,0003,998,0002,375,680
2Jan 14, 2026 02:195,157197,807,338166,189,0004,004,0002,379,776
3Jan 14, 2026 02:195,160196,276,647166,286,0004,006,0002,277,376
4Jan 13, 2026 23:005,171197,307,927165,642,0004,989,0002,375,680
5Jan 14, 2026 02:195,178202,457,889166,871,0003,996,0002,277,376
6Jan 13, 2026 23:005,187198,737,928167,164,0004,003,0002,461,696