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 listApr 20, 2026 15:13BenBenScore: 78,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 15:1878,0842,602,605,3142,519,802,00056,972,0002,461,696
2Apr 20, 2026 15:1878,4632,611,792,6862,524,323,00064,956,0002,265,088
3Apr 20, 2026 15:1880,6002,686,206,3042,594,858,00064,971,0002,473,984