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 22, 2025 20:39Gerard SmitGerard SmitScore: 150,648Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 20:39149,2104,953,068,4754,897,939,00025,983,0002,424,832
2Jan 22, 2025 20:39150,6485,003,881,3094,941,398,00029,984,0002,441,216
3Jan 22, 2025 20:39165,7625,506,286,2465,445,161,00024,982,0002,478,080