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 25, 2024 23:03Andrey LikhachevAndrey LikhachevError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2024 23:0600000Error: expected "1024506 ", got "1024507 "stderr
2Jul 25, 2024 23:0600000Error: expected "1025713 ", got "1025714 "stderr
3Jul 25, 2024 23:0900000Error: expected "1023507 ", got "1023506 "stderr
4Jul 25, 2024 23:1000000Error: expected "1020268 ", got "1020269 "stderr
5Jul 25, 2024 23:1000000Error: expected "1018984 ", got "1018985 "stderr
6Jul 25, 2024 23:0334,3861,202,071,0621,134,743,44302,260,992
7Jul 25, 2024 23:0334,3981,201,150,3461,135,143,08202,248,704
8Jul 25, 2024 23:0344,3841,529,497,0231,464,661,07202,256,896