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 listFeb 21, 2026 01:58Josu San MartinJosu San MartinScore: 4,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 01:584,326176,889,540139,756,0002,994,0002,289,664
2Feb 21, 2026 01:564,328163,675,277141,823,000998,0002,289,664
3Feb 21, 2026 01:564,328169,132,352140,825,0001,997,0002,400,256
4Feb 21, 2026 01:584,330166,375,352141,907,000999,0002,289,664
5Feb 21, 2026 01:584,332170,535,150139,973,0002,999,0002,289,664
6Feb 21, 2026 01:564,361173,826,774141,916,0001,998,0002,289,664