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 listNov 26, 2024 21:38MatthiasMatthiasScore: 109,133Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2024 21:38108,0763,591,588,3963,482,581,00083,917,0002,281,472
2Nov 26, 2024 21:38109,1333,626,961,5823,498,499,000102,897,0002,281,472
3Nov 26, 2024 21:38109,7573,652,397,2143,525,105,00096,892,0002,281,472