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 9, 2024 09:20Joad NacerJoad NacerScore: 5,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2024 09:205,088193,198,350154,925,00012,993,0002,461,696
2Sep 9, 2024 09:205,118190,320,569154,893,00013,990,0002,461,696
3Sep 9, 2024 09:205,171196,125,435157,673,00012,973,0002,465,792
4Sep 9, 2024 09:205,199192,421,590157,588,00013,963,0002,285,568
5Sep 9, 2024 09:205,214197,959,216162,049,00010,003,0002,334,720
6Sep 9, 2024 09:205,467207,537,353167,466,00012,958,0002,465,792
7Sep 9, 2024 09:205,477204,498,508167,759,00012,981,0002,461,696
8Sep 9, 2024 09:205,499203,720,095167,511,00013,959,0002,338,816
9Sep 9, 2024 09:205,506201,109,046166,735,00014,976,0002,457,600