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 listMay 4, 2023 20:43korinfkorinfScore: 117,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2023 20:42115,2843,864,089,9593,804,381,77402,285,568
2May 4, 2023 20:43115,3123,883,574,9433,805,308,14202,187,264
3May 4, 2023 20:42115,3833,868,569,5483,807,622,57502,174,976
4May 4, 2023 20:43117,1893,934,199,8723,867,249,60602,179,072
5May 4, 2023 20:43117,2373,921,217,7713,868,824,64602,285,568
6May 4, 2023 20:42117,2473,950,480,5693,869,160,54002,269,184