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 listFeb 16, 2025 19:22Ian MckibbenIan MckibbenScore: 27,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2025 19:2227,565935,648,454821,679,00087,965,0002,379,776
2Feb 16, 2025 19:2227,610938,821,251831,218,00079,924,0002,322,432
3Feb 16, 2025 19:2227,737938,743,096834,377,00080,939,0002,531,328