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 29, 2022 12:49Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2022 12:4900000Error: expected "1026078 ", got "1026077"
2Aug 29, 2022 12:5000000Error: expected "1026306 ", got "1026305"
3Aug 29, 2022 12:5000000Error: expected "1026099 ", got "1026098"
4Aug 29, 2022 12:508,855350,347,399292,215,15102,273,280
5Aug 29, 2022 12:508,898350,150,371293,647,32702,285,568
6Aug 29, 2022 12:508,931362,276,522294,733,40502,277,376