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 2, 2025 21:36KeefeKeefeScore: 90,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2025 21:3689,9852,994,315,5552,814,569,000154,921,0002,314,240
2Feb 2, 2025 21:3690,2113,009,820,5152,836,069,000140,904,0002,375,680
3Feb 2, 2025 21:3690,9923,034,568,0222,838,849,000163,875,0002,416,640