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 00:33Egor SergeevEgor SergeevScore: 72,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2021 16:2772,1902,436,203,4352,382,255,45002,256,896
2Jun 15, 2021 16:2772,7292,466,088,0732,400,053,41002,248,704
3Jul 4, 2021 00:3372,7722,453,918,1582,401,467,57502,248,704
4Jun 15, 2021 16:2772,7872,462,812,9162,401,987,30802,240,512
5Jul 4, 2021 00:3372,8762,471,544,5162,404,906,06202,265,088
6Jul 4, 2021 00:3372,9972,473,273,9612,408,903,89502,248,704