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 12, 2026 23:18Adam FolwarcznyAdam FolwarcznyScore: 31,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 23:1830,9441,051,200,1281,017,161,0003,992,0002,510,848
2Jan 12, 2026 23:1831,0191,049,828,1251,019,629,0003,994,0002,510,848
3Jan 12, 2026 23:1831,3091,061,052,5301,029,217,0003,993,0002,355,200