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 listApr 30, 2024 18:45Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2024 18:4400000Error: expected "1021918 ", got "1021915 "stderr
2Apr 30, 2024 18:4500000Error: expected "1018773 ", got "1018772 "stderr
3Apr 30, 2024 18:4500000Error: expected "1024867 ", got "1024866 "stderr
4Apr 30, 2024 18:4500000Error: expected "1020382 ", got "1020380 "stderr
5Apr 30, 2024 18:4521,452789,014,148707,921,39902,203,648
6Apr 30, 2024 18:4521,931785,301,684723,714,61202,203,648
7Apr 30, 2024 18:4522,009792,678,389726,285,72702,207,744