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:48Adam FolwarcznyAdam FolwarcznyScore: 31,464Success
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:4831,4001,064,440,0841,023,225,00012,990,0002,289,664
2Jan 12, 2026 22:4831,4641,069,470,7071,027,329,00010,992,0002,301,952
3Jan 12, 2026 22:4831,5921,071,642,8391,028,554,00013,993,0002,314,240