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 04:46Josu San MartinJosu San MartinScore: 3,529Success
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 04:473,517124,800,037114,971,0001,121,0002,113,536
2May 13, 2026 04:473,521126,703,115115,076,0001,129,0002,113,536
3May 13, 2026 04:473,524126,956,614115,247,0001,050,0002,113,536
4May 13, 2026 04:473,527126,730,152115,277,0001,120,0002,113,536
5May 13, 2026 04:473,529127,183,083115,374,0001,115,0002,113,536
6May 13, 2026 04:473,529125,209,088115,362,0001,121,0002,113,536
7May 13, 2026 04:473,532125,398,307115,447,0001,114,0002,113,536
8May 13, 2026 04:473,541126,794,671115,731,0001,132,0002,113,536
9May 13, 2026 04:473,547128,724,087115,928,0001,129,0002,113,536