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 31, 2022 07:17wireless anonwireless anonError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2022 07:1500000Error: expected "1025344 ", got "1025343"
2Aug 31, 2022 07:1700000Error: expected "1026045 ", got "1026044"
3Aug 31, 2022 07:1792,4163,106,886,8103,049,738,24002,281,472
4Aug 31, 2022 07:1792,7663,117,083,5243,061,284,12602,269,184
5Aug 31, 2022 07:1793,0473,139,788,9903,070,554,22102,273,280