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 20, 2026 19:51Pavel SkripkinPavel SkripkinScore: 30,855Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2026 19:5130,6761,039,687,9961,010,309,0001,998,0002,543,616
2Jan 20, 2026 19:5130,8551,043,769,7511,015,225,0002,997,0002,543,616
3Jan 20, 2026 19:5131,4941,062,598,7391,036,305,0002,997,0002,433,024