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 listSep 17, 2024 10:15Joad NacerJoad NacerScore: 5,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2024 10:174,903184,320,332147,824,00013,983,0002,338,816
2Sep 17, 2024 10:154,978186,774,415153,242,00011,017,0002,465,792
3Sep 17, 2024 10:175,065194,246,569152,125,00015,012,0002,457,600
4Sep 17, 2024 10:155,262195,694,170159,678,00013,971,0002,461,696
5Sep 17, 2024 10:175,280201,446,258162,210,00012,015,0002,465,792
6Sep 17, 2024 10:155,317195,892,346160,422,00015,039,0002,469,888