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 listSep 25, 2025 14:39Wookyung JeongWookyung JeongScore: 237,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 14:39236,5237,835,703,8277,576,411,000228,861,0002,289,664
2Sep 25, 2025 14:39237,2077,858,494,5537,613,979,000213,858,0002,498,560
3Sep 25, 2025 14:39238,5487,904,495,3877,670,207,000201,873,0002,277,376