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 19, 2025 11:31Rajarshi BasuRajarshi BasuScore: 7,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 11:316,233232,197,253198,713,0006,989,0002,334,720
2Dec 19, 2025 11:316,290232,010,320200,600,0006,986,0002,367,488
3Dec 19, 2025 11:316,680245,604,509215,440,0005,010,0002,428,928
4Dec 19, 2025 11:317,505273,588,628236,693,00010,985,0002,322,432
5Dec 19, 2025 11:317,534271,983,570239,651,0008,986,0002,338,816
6Dec 19, 2025 11:317,850280,953,755251,056,0008,001,0002,498,560