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 23, 2025 05:13Josu San MartinJosu San MartinScore: 42,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 04:4542,3131,422,142,3461,382,344,00013,993,0002,273,280
2Dec 23, 2025 05:1242,3961,426,754,6401,389,085,0009,993,0002,289,664
3Dec 23, 2025 04:4542,4131,426,384,8991,387,649,00011,996,0002,285,568
4Dec 23, 2025 05:1342,4291,422,561,4681,389,174,00010,993,0002,318,336
5Dec 23, 2025 05:1242,7251,441,589,3201,400,926,0008,993,0002,293,760
6Dec 23, 2025 04:4543,6391,466,026,9431,427,111,00012,991,0002,334,720
7Dec 23, 2025 05:1244,4431,498,883,7691,454,624,00011,988,0002,293,760
8Dec 23, 2025 05:1345,1111,511,287,8391,476,662,00011,989,0002,277,376
9Dec 23, 2025 05:1345,6151,530,566,4721,495,316,0009,988,0002,510,848