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 06:09wireless 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 06:0800000Error: expected "1021242 ", got "1021240"
2Aug 31, 2022 06:0971,4892,434,299,8832,359,126,35202,199,552
3Aug 31, 2022 06:0973,2052,478,357,3432,415,771,06702,187,264
4Aug 31, 2022 06:0974,1202,500,608,3592,445,969,46702,191,360