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 10, 2026 18:22Pavel SkripkinPavel SkripkinScore: 60,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 18:2260,7332,035,566,5811,999,177,0004,997,0002,301,952
2Jan 10, 2026 18:2260,7752,042,209,4601,999,591,0005,995,0002,371,584
3Jan 10, 2026 18:2261,0092,043,075,1782,007,303,0005,994,0002,281,472