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 17, 2025 19:23Rajarshi BasuRajarshi BasuScore: 8,063Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2025 19:237,979289,003,471257,304,0006,007,0002,527,232
2Dec 17, 2025 19:238,001289,955,761256,025,0008,000,0002,486,272
3Dec 17, 2025 19:238,011290,759,265257,354,0007,009,0002,363,392
4Dec 17, 2025 19:238,034295,701,079259,117,0006,002,0002,326,528
5Dec 17, 2025 19:238,063290,681,363257,077,0009,002,0002,269,184
6Dec 17, 2025 19:238,094297,643,964260,097,0007,002,0002,322,432
7Dec 17, 2025 19:238,106297,568,357257,532,0009,981,0002,379,776
8Dec 17, 2025 19:238,220299,803,353264,255,0007,006,0002,289,664
9Dec 17, 2025 19:238,538308,175,670273,750,0007,992,0002,519,040