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 3, 2024 19:37Jatin YadavJatin YadavScore: 58,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2024 19:3757,9001,941,520,8131,902,706,0007,994,0002,519,040
2Sep 3, 2024 19:3758,2051,945,739,3851,913,769,0006,995,0002,498,560
3Sep 3, 2024 19:3763,4292,118,636,0852,085,169,0007,996,0002,277,376