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 15, 2026 23:35Adam FolwarcznyAdam FolwarcznyScore: 10,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 23:3510,375372,243,216332,374,00010,011,0002,453,504
2Jan 15, 2026 23:3510,464379,582,977340,314,0005,004,0002,486,272
3Jan 15, 2026 23:3511,122389,571,525358,032,0009,000,0002,490,368