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 listMar 6, 2026 21:46Pavel SamyginPavel SamyginScore: 26,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 21:4625,973885,606,779837,130,00019,979,0002,330,624
2Mar 6, 2026 21:4626,187891,958,218841,195,00022,978,0002,269,184
3Mar 6, 2026 21:4626,552904,193,467851,236,00024,977,0002,490,368