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 listOct 17, 2026 04:36e1011e1011Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 04:3706,780,613,3656,743,900,00025,074,0002,113,536expected "1025431 ", got "1018476 "
2Oct 17, 2026 04:3706,725,138,2396,690,155,00023,449,0002,113,536expected "1022795 ", got "1015835 "
3Oct 17, 2026 04:3706,867,166,6046,830,175,00025,604,0002,113,536expected "1023782 ", got "1016518 "