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 22:49Adam FolwarcznyAdam FolwarcznyScore: 11,499Success
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 22:4911,466402,287,744359,417,00018,969,0002,285,568
2Jan 15, 2026 22:4911,499404,100,012360,486,00018,972,0002,469,888
3Jan 15, 2026 22:4911,604408,776,192364,925,00017,996,0002,371,584