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 listSep 3, 2023 03:52matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2023 03:5200000Error: expected "1022511 ", got "1022505 "stderr
2Sep 3, 2023 03:5400000Error: expected "1026031 ", got "1026026 "stderr
3Sep 3, 2023 04:0500000Error: expected "1025156 ", got "1025154 "stderr
4Sep 3, 2023 04:0600000Error: expected "1024608 ", got "1024604 "stderr
5Sep 3, 2023 04:0700000Error: expected "1021666 ", got "1021659 "stderr
6Sep 3, 2023 04:0800000Error: expected "1021752 ", got "1021744 "stderr