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 listMay 12, 2026 23:16Josu San MartinJosu San MartinScore: 4,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 23:173,997140,826,968130,848,0001,075,0002,113,536
2May 12, 2026 23:173,998142,947,472130,902,0001,040,0002,113,536
3May 12, 2026 23:173,998143,185,933130,882,0001,060,0002,113,536
4May 12, 2026 23:174,001141,646,125130,996,0001,069,0002,113,536
5May 12, 2026 23:174,002140,860,699131,009,0001,069,0002,113,536
6May 12, 2026 23:174,002140,920,446131,006,0001,067,0002,113,536
7May 12, 2026 23:174,004141,111,608131,088,0001,067,0002,113,536
8May 12, 2026 23:174,010141,126,065131,276,0001,072,0002,113,536
9May 12, 2026 23:174,011143,469,123131,301,0001,066,0002,113,536