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 listDec 28, 2025 02:32Josu San MartinJosu San MartinScore: 50,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2025 02:3250,0481,676,712,4451,641,582,0009,997,0002,408,448
2Dec 28, 2025 02:3250,0621,680,498,5531,640,055,00011,993,0002,281,472
3Dec 28, 2025 02:3252,3651,753,485,1851,715,059,00012,992,0002,519,040