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 listMar 22, 2026 02:55olliecrowolliecrowScore: 13,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 02:5512,957454,214,435419,571,0008,010,0002,437,120
2Mar 22, 2026 02:5513,189459,709,438421,226,00014,007,0002,469,888
3Mar 22, 2026 02:5513,226464,454,436422,475,00013,982,0002,363,392