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 listAug 20, 2022 12:04Bernard TeoBernard TeoScore: 95,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2022 12:0193,8943,163,722,4813,098,499,10902,187,264
2Aug 20, 2022 12:0194,1953,173,231,4303,108,431,88202,187,264
3Aug 20, 2022 12:0194,9103,196,041,2503,132,020,05902,191,360
4Aug 20, 2022 12:0495,2693,214,060,7043,143,875,91502,183,168
5Aug 20, 2022 12:0496,1763,235,664,3983,173,804,75602,191,360
6Aug 20, 2022 12:0496,4773,244,428,8643,183,735,06102,179,072