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 17, 2025 18:52Rajarshi BasuRajarshi BasuScore: 8,981Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2025 18:558,838322,191,752286,672,0004,994,0002,453,504
2Dec 17, 2025 18:528,866323,364,489284,591,0007,988,0002,494,464
3Dec 17, 2025 18:558,973321,855,672290,123,0006,002,0002,408,448
4Dec 17, 2025 18:528,981327,516,643291,371,0005,006,0002,301,952
5Dec 17, 2025 18:558,989323,372,617288,632,0007,989,0002,334,720
6Dec 17, 2025 18:529,856356,068,846318,269,0006,983,0002,523,136