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 listJan 3, 2026 05:23Rajarshi BasuRajarshi BasuScore: 3,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 05:233,301132,738,805103,921,0004,996,0002,297,856
2Jan 3, 2026 05:243,308135,546,803105,145,0004,005,0002,383,872
3Jan 3, 2026 05:243,313136,919,130105,317,0004,012,0002,523,136
4Jan 3, 2026 05:243,328137,574,864105,833,0003,993,0002,297,856
5Jan 3, 2026 05:233,422138,106,189108,918,0003,996,0002,514,944
6Jan 3, 2026 05:233,736150,885,781120,280,0003,007,0002,510,848