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 10, 2025 14:11E SequeiraE SequeiraScore: 96,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2025 14:1195,8913,199,102,6803,150,408,00013,988,0002,281,472
2Feb 10, 2025 14:1196,8463,223,708,9923,180,929,00014,990,0002,281,472
3Feb 10, 2025 14:1198,3093,273,209,1513,234,203,0009,988,0002,523,136