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 22:04Adam FolwarcznyAdam FolwarcznyScore: 59,624Success
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 22:0459,5281,992,983,8371,952,440,00011,996,0002,453,504
2Jan 12, 2026 22:0459,6241,993,086,6711,956,608,00010,992,0002,453,504
3Jan 12, 2026 22:0460,7802,033,549,5281,990,760,00014,990,0002,334,720