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 4, 2021 18:54Sergey SamokhvalovSergey SamokhvalovScore: 465,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2021 18:54464,03315,393,361,63815,313,079,92202,269,184
2Jul 4, 2021 18:54465,11415,405,990,63815,348,773,19802,232,320
3Jul 4, 2021 18:54466,86715,466,438,71815,406,625,15202,252,800