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 21:32Adam FolwarcznyAdam FolwarcznyScore: 76,253Success
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 21:3275,7952,529,339,1152,487,240,00013,995,0002,519,040
2Jan 12, 2026 21:3276,2532,550,851,9882,506,340,0009,993,0002,314,240
3Jan 12, 2026 21:3277,8232,601,428,1292,553,183,00014,989,0002,510,848