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 14, 2026 20:55Adam FolwarcznyAdam FolwarcznyScore: 14,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 14, 2026 20:5514,138488,485,768457,557,0008,991,0002,285,568
2Jan 14, 2026 20:5514,176491,518,490460,820,0006,997,0002,306,048
3Jan 14, 2026 20:5514,184490,475,954462,075,0006,000,0002,502,656