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 listDec 31, 2025 02:57Josu San MartinJosu San MartinScore: 58,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 02:5743,8051,860,454,656704,123,000741,440,0002,416,640
2Dec 31, 2025 02:5758,8483,258,920,334856,501,0001,085,497,0002,531,328
3Dec 31, 2025 02:5793,3264,517,527,698960,680,0002,119,090,0002,510,848