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 13, 2026 17:55Oleg SkinderevOleg SkinderevScore: 120,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 17:55120,3883,998,281,3433,950,802,00021,987,0002,494,464
2Apr 13, 2026 17:55120,8494,016,306,0713,968,024,00019,990,0002,269,184
3Apr 13, 2026 17:55121,4224,034,802,5033,985,944,00020,989,0002,322,432