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 listJul 8, 2024 23:36Joad 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
1Jul 8, 2024 23:3600000Error: expected "1022105 ", got "1022103 "stderr
2Jul 8, 2024 23:3700000Error: expected "1019739 ", got "1019737 "stderr
3Jul 8, 2024 23:4100000Error: expected "1023102 ", got "1023101 "stderr
4Jul 8, 2024 23:4100000Error: expected "1021937 ", got "1021933 "stderr