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 listDec 15, 2021 15:38Yuriy LyfenkoYuriy LyfenkoScore: 35,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2021 15:3835,5741,229,569,3681,173,929,09402,232,320
2Dec 15, 2021 15:3835,7571,241,672,0051,179,972,01802,228,224
3Dec 15, 2021 15:3836,4491,272,659,9341,202,826,52602,232,320