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:01Adam FolwarcznyAdam FolwarcznyScore: 11,217Success
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:0111,175391,626,186353,794,00014,991,0002,375,680
2Jan 15, 2026 23:0111,217391,382,551352,147,00018,007,0002,473,984
3Jan 15, 2026 23:0111,406401,656,350361,389,00015,016,0002,437,120