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 listNov 7, 2024 16:46spacecat8086spacecat8086Score: 316,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2024 16:46316,31610,468,589,09010,393,467,00044,976,0002,437,120
2Nov 7, 2024 16:46316,87910,487,903,91110,419,045,00037,978,0002,424,832
3Nov 7, 2024 16:46318,89710,557,487,92710,495,627,00027,983,0002,539,520