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 listSep 17, 2021 20:51Malik ShamsutdinovMalik ShamsutdinovScore: 97,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2021 20:5197,3323,273,442,6213,211,941,45702,187,264
2Sep 17, 2021 20:5197,4813,280,577,1903,216,866,03802,191,360
3Sep 17, 2021 20:51100,8933,398,681,1423,329,460,09602,260,992