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 listFeb 17, 2025 09:09Ian MckibbenIan MckibbenScore: 19,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2025 09:0919,758677,168,836589,023,00063,002,0002,310,144
2Feb 17, 2025 09:0919,834672,995,812575,594,00078,944,0002,269,184
3Feb 17, 2025 09:0919,880684,353,015582,046,00074,005,0002,269,184