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 13, 2026 05:01Josu San MartinJosu San MartinScore: 3,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 05:023,520126,567,477115,068,0001,112,0002,113,536
2May 13, 2026 05:023,522126,784,425115,098,0001,130,0002,113,536
3May 13, 2026 05:023,524127,312,706115,191,0001,111,0002,113,536
4May 13, 2026 05:023,526127,122,628115,248,0001,128,0002,113,536
5May 13, 2026 05:023,528125,671,111115,298,0001,126,0002,113,536
6May 13, 2026 05:023,528125,465,714115,323,0001,131,0002,113,536
7May 13, 2026 05:023,531126,822,636115,426,0001,124,0002,113,536
8May 13, 2026 05:023,532125,323,970115,439,0001,128,0002,113,536
9May 13, 2026 05:023,571127,312,804116,721,0001,122,0002,113,536