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 listDec 20, 2025 08:20Rajarshi BasuRajarshi BasuScore: 5,352Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 08:205,331201,485,761170,931,0004,997,0002,453,504
2Dec 20, 2025 08:205,332203,917,237168,955,0006,998,0002,445,312
3Dec 20, 2025 08:195,333204,222,379169,978,0005,999,0002,514,944
4Dec 20, 2025 08:205,348202,716,654169,477,0007,019,0002,433,024
5Dec 20, 2025 08:195,352203,178,371169,619,0006,984,0002,494,464
6Dec 20, 2025 08:205,396199,776,887172,075,0006,002,0002,523,136
7Dec 20, 2025 08:205,454202,339,421174,982,0004,999,0002,338,816
8Dec 20, 2025 08:205,547206,587,650177,065,0006,002,0002,326,528
9Dec 20, 2025 08:195,564209,561,996176,634,0006,985,0002,445,312